咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是31-40 订阅
排序:
Shooting Permanent Rays among Disjoint Polygons in the Plane
Shooting Permanent Rays among Disjoint Polygons in the Plane
收藏 引用
25th Annual Symposium on Computational Geometry
作者: Ishaque, Mashhood Speckmann, Bettina Toth, Csaba D. Tufts Univ Dept Comp Sci Medford MA 02155 USA
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at the boundary of some obstacle. The port... 详细信息
来源: 评论
PAMS: Pattern Aware Memory System for Embedded Systems
PAMS: Pattern Aware Memory System for Embedded Systems
收藏 引用
2014 International Conference on Reconfigurable Computing and FAGAs
作者: Hussain, Tassadaq Sonmez, Nehir Palomar, Oscar Unsal, Osman Cristal, Adrian Ayguade, Eduard Valero, Mateo Gursal, S. A. Barcelona Supercomp Ctr Comp Sci Barcelona Spain Unal Ctr Educ Res & Dev Barcelona Spain Univ Politecn Cataluna Dept Arquitectura Comp Barcelona Spain CSIC Artificial Intelligence Res Inst IIIA Barcelona Spain
In this paper, we propose a hardware mechanism for embedded multi-core memory system called Pattern Aware Memory System (PAMS). The PAMS supports static and dynamic data structures using descriptors and specialized me... 详细信息
来源: 评论
A dynamic I/O-Efficient structure for One-Dimensional Top-k Range Reporting  14
A Dynamic I/O-Efficient Structure for One-Dimensional Top-k ...
收藏 引用
33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of database Systems
作者: Tao, Yufei CUHK Hong Kong Hong Kong Peoples R China
We present a structure in external memory for top-k range reporting, which uses linear space, answers a query in O(lg(B) n + k/B) I/Os, arid supports an update in O(lg(B) n) amortized I/Os, where n is the input size, ... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Maintaining Densest Subsets Efficiently in Evolving Hypergraphs  17
Maintaining Densest Subsets Efficiently in Evolving Hypergra...
收藏 引用
ACM Conference on Information and Knowledge Management (CIKM)
作者: Hu, Shuguang Wu, Xiaowei Chan, T-H. Hubert Univ Hong Kong Pokfulam Rd Hong Kong Hong Kong Peoples R China
In this paper we study the densest subgraph problem, which plays a key role in many graph mining applications. The goal of the problem is to find a subset of nodes that induces a graph with maximum average degree. The... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Optimizing to Memory Application in Embedded Multimedia Device
Optimizing to Memory Application in Embedded Multimedia Devi...
收藏 引用
International Conference on Advanced Design and Manufacturing Engineering (ADME 2011)
作者: Wang, Xiaosheng Yu, Qian Shandong Womens Univ Informat & Technol Sch Jinan Peoples R China
The modern embedded multimedia electronic devices rely on dynamically-allocated data structures to store and process their data, as a result, the demand of its memory capacity and dynamic are increasing unceasingly. I... 详细信息
来源: 评论
Test Generation for Programs with Binary Tree structure as Input
收藏 引用
INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING 2015年 第7期25卷 1129-1151页
作者: Zhao, Ruilian Li, Zheng Wang, Qian Beijing Univ Chem Technol Dept Comp Sci Beijing 100029 Peoples R China
Test data generation is a process of creating program inputs that satisfy specific testing criteria. Many works have been focused on test generation with respect to numeric and string data. dynamic data structures, su... 详细信息
来源: 评论
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... 详细信息
来源: 评论