咨询与建议

限定检索结果

文献类型

  • 27 篇 期刊文献
  • 14 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 42 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 32 篇 工学
    • 27 篇 计算机科学与技术...
    • 7 篇 软件工程
    • 5 篇 电气工程
    • 2 篇 机械工程
    • 2 篇 信息与通信工程
    • 2 篇 生物医学工程(可授...
    • 1 篇 仪器科学与技术
    • 1 篇 材料科学与工程(可...
  • 24 篇 理学
    • 23 篇 数学
    • 1 篇 生物学
  • 2 篇 医学
    • 2 篇 基础医学(可授医学...
    • 1 篇 临床医学
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...

主题

  • 42 篇 dynamic data str...
  • 5 篇 point location
  • 3 篇 planar subdivisi...
  • 3 篇 analysis of algo...
  • 3 篇 computational ge...
  • 2 篇 dynamic algorith...
  • 2 篇 binary tree
  • 2 篇 priority search ...
  • 2 篇 approximation al...
  • 2 篇 planar point loc...
  • 1 篇 multi-objective ...
  • 1 篇 68a20
  • 1 篇 range
  • 1 篇 octree
  • 1 篇 management of re...
  • 1 篇 h.3.3
  • 1 篇 lazy update
  • 1 篇 table look up
  • 1 篇 graph decomposit...
  • 1 篇 scalability

机构

  • 2 篇 brown univ dept ...
  • 2 篇 chinese univ hon...
  • 2 篇 univ illinois co...
  • 1 篇 natl inst inform...
  • 1 篇 inst sci & techn...
  • 1 篇 univ vienna fac ...
  • 1 篇 saarland univ d-...
  • 1 篇 univ minnesota d...
  • 1 篇 barcelona superc...
  • 1 篇 univ warsaw inst...
  • 1 篇 veermata jijabai...
  • 1 篇 univ politecn ca...
  • 1 篇 ewha womans univ...
  • 1 篇 tel aviv univ sc...
  • 1 篇 univ aarhus dept...
  • 1 篇 univ udine udine
  • 1 篇 nyu courant inst...
  • 1 篇 univ pisa dipart...
  • 1 篇 carleton univ sc...
  • 1 篇 shandong womens ...

作者

  • 3 篇 taylor d
  • 3 篇 boulton s
  • 3 篇 tamassia r
  • 3 篇 naguib rng
  • 2 篇 brodal gerth sto...
  • 2 篇 rao s. srinivasa
  • 2 篇 james a
  • 2 篇 wu xiaowei
  • 2 篇 arge lars
  • 2 篇 amin s
  • 1 篇 munro j. ian
  • 1 篇 chen yongquan
  • 1 篇 patel neel
  • 1 篇 mazowiecki filip
  • 1 篇 boris jp
  • 1 篇 meshram b. b.
  • 1 篇 sun jonathan z.
  • 1 篇 xiao wenlei
  • 1 篇 hussain tassadaq
  • 1 篇 pilipczuk michal

语言

  • 34 篇 英文
  • 8 篇 其他
检索条件"主题词=Dynamic Data Structure"
42 条 记 录,以下是1-10 订阅
排序:
dynamic data structures for Timed Automata Acceptance
收藏 引用
ALGORITHMICA 2022年 第11期84卷 3223-3245页
作者: Grez, Alejandro Mazowiecki, Filip Pilipczuk, Michal Puppis, Gabriele Riveros, Cristian Pontificia Univ Catolica Chile Santiago Chile Millennium Inst Foundat Res Data Santiago Chile Univ Warsaw Warsaw Poland Univ Udine Udine Italy
We study a variant of the classical membership problem in automata theory, which consists of deciding whether a given input word is accepted by a given automaton. We do so through the lenses of parameterized dynamic d... 详细信息
来源: 评论
MetaFactory: A cloud-based framework to configure and generate dynamic data structures from the STEP-NC knowledge graph
收藏 引用
JOURNAL OF MANUFACTURING SYSTEMS 2025年 80卷 89-107页
作者: Xiao, Wenlei Qiu, Tianze Guo, Jiurong Zhao, Gang Beihang Univ Sch Mech Engn & Automat Beijing 100191 Peoples R China Beihang Univ Jiangxi Res Inst Nanchang 330200 Peoples R China Beihang Univ Jingdezhen Res Inst Jingdezhen 333000 Peoples R China AV Chengdu Aircraft Ind Grp Co Ltd Chengdu 610031 Peoples R China
In our previous studies, twin-oriented manufacturing has been identified as a crucial solution to address the manufacturing crisis. Within this context, the notion of "digital twin as a service" necessitates... 详细信息
来源: 评论
Concolic Testing of Programs with Concurrent dynamic data structures
Concolic Testing of Programs with Concurrent Dynamic Data St...
收藏 引用
作者: Sun, Xiaofan University of California Riverside
学位级别:Ph.D., Doctor of Philosophy
Concolic execution combines concrete execution with symbolic execution to automatically generate test inputs that exercise different program paths and deliver high code coverage. However, when this technique is extend... 详细信息
来源: 评论
Listing the bonds of a graph in O(n)-delay
收藏 引用
DISCRETE APPLIED MATHEMATICS 2024年 348卷 105-121页
作者: Raffaele, Alice Rizzi, Romeo Uno, Takeaki Dept Mech Energy & Management Via Pietro Bucci-Cubo 46C I-87036 Arcavacata di Rende Italy Univ Verona Dept Comp Sci Str Le Grazie 15 I-37134 Verona Italy Natl Inst Informat 2-1-2 HitotsubashiChiyoda ku Tokyo 1018430 Japan
Given a connected graph G = (V, E), with n := |V| vertices and m := |E| edges, a cut can be represented as a bipartition {S, S} of the vertices or as the set of those edges in E having one endpoint in S and the other ... 详细信息
来源: 评论
DETERMINISTIC NEAR-OPTIMAL APPROXIMATION ALGORITHMS FOR dynamic SET COVER
收藏 引用
SIAM JOURNAL ON COMPUTING 2023年 第5期52卷 1132-1192页
作者: Bhattacharya, Sayan Henzinger, Monika Nanongkai, Danupon Wu, Xiaowei Univ Warwick Coventry CV4 7AL England Inst Sci & Technol Austria ISTA A-1090 Vienna Austria Max Planck Inst Informat D-66123 Saarbrucken Germany Saarland Univ D-66123 Saarbrucken Germany Univ Macau Macau Peoples R China
In the dynamic minimum set cover problem, the challenge is to minimize the update time while guaranteeing a close-to-optimal min{O(log n), f\} approximation factor. (Throughout, n, m, f, and C are parameters denoting ... 详细信息
来源: 评论
Near-Optimal (1+ε)-Approximate Fully-dynamic All-Pairs Shortest Paths in Planar Graphs  65
Near-Optimal (1+ε)-Approximate Fully-Dynamic All-Pairs Shor...
收藏 引用
65th Symposium on Foundations of Computer Science
作者: Filtser, Arnold Patel, Neel Goranci, Gramoz Gutenberg, Maximilian Probst Bar Ilan Univ Comp Sci Dept Ramat Gan Israel Univ Southern Calif Dept Comp Sci Los Angeles CA 90007 USA Univ Vienna Fac Comp Sci Vienna Austria Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland
We study the fully-dynamic all-pair shortest paths (APSP) problem on planar graphs: given an n-vertex planar graph G = ( V, E) undergoing edge insertions and deletions, the goal is to efficiently process these updates... 详细信息
来源: 评论
dynamically Allocated Bloom Filter-Based PIT Architectures
收藏 引用
IEEE ACCESS 2022年 10卷 28165-28179页
作者: Jang, Saeyoung Byun, Hayoung Lim, Hyesook Ewha Womans Univ Dept Elect & Elect Engn Seoul 03760 South Korea Myongji Univ Dept Elect Engn Yongin 17058 South Korea
As a key component in implementing Named data Networking (NDN), Pending Interest Table (PIT) requires an efficient exact-matching algorithm for a scalable and fast PIT lookup. A Bloom filter (BF) is a memory-efficient... 详细信息
来源: 评论
Memento Filter: A Fast, dynamic, and Robust Range Filter
收藏 引用
Proceedings of the ACM on Management of data 2024年 第6期2卷 1-27页
作者: Navid Eslami Niv Dayan University of Toronto Toronto Ontario CA
Range filters are probabilistic data structures that answer approximate range emptiness queries. They aid in avoiding processing empty range queries and have use cases in many application domains such as key-value sto... 详细信息
来源: 评论
Fully dynamic Approximation of LIS in Polylogarithmic Time  2021
Fully Dynamic Approximation of LIS in Polylogarithmic Time
收藏 引用
53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC)
作者: Gawrychowski, Pawel Janczewski, Wojciech Univ Wroclaw Wroclaw Poland
We revisit the problem of maintaining the longest increasing sub-sequence (LIS) of an array under (i) inserting an element, and (ii) deleting an element of an array. In a recent breakthrough, Mitzen-macher and Seddigh... 详细信息
来源: 评论
Covering Users by a Connected Swarm Efficiently  1
收藏 引用
16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)
作者: Danilchenko, Kiril Segal, Michael Nutov, Zeev Ben Gurion Univ Negev Sch Elect & Comp Engn Beer Sheva Israel Open Univ Israel Raanana Israel
In this paper we study covering problems that arise in wireless networks with Unmanned Aerial Vehicles (UAVs) swarms. In the general setting we want to place a set of UAVs that should cover a given set of planar users... 详细信息
来源: 评论