Sciweavers

1396 search results - page 24 / 280
» Succinct Dynamic Data Structures
Sort
View
FOCS
1992
IEEE
14 years 17 days ago
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
Pankaj K. Agarwal, David Eppstein, Jirí Mat...
TMC
2008
91views more  TMC 2008»
13 years 8 months ago
Dynamic Forwarding over Tree-on-DAG for Scalable Data Aggregation in Sensor Networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreo...
Kai-Wei Fan, Sha Liu, Prasun Sinha
ICDE
2008
IEEE
167views Database» more  ICDE 2008»
14 years 9 months ago
Towards Declarative Queries on Adaptive Data Structures
In this work we look at combining emerging technologies in programming languages with traditional query processing techniques to provide support for efficient execution of declarat...
Nicolas Bruno, Pablo Castro
PODC
2003
ACM
14 years 1 months ago
Software transactional memory for dynamic-sized data structures
We propose a new form of software transactional memory (STM) designed to support dynamic-sized data structures, and we describe a novel non-blocking implementation. The non-blocki...
Maurice Herlihy, Victor Luchangco, Mark Moir, Will...
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
13 years 10 months ago
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
Guy E. Blelloch