Sciweavers

11991 search results - page 371 / 2399
» Data Structure Fusion
Sort
View
WWW
2006
ACM
16 years 7 months ago
Symmetrically exploiting XML
Path expressions are the principal means of locating data in a hierarchical model. But path expressions are brittle because they often depend on the structure of data and break if...
Shuohao Zhang, Curtis E. Dyreson
IMR
2003
Springer
15 years 12 months ago
Compact Representations of Simplicial Meshes in Two and Three Dimensions
We describe data structures for representing simplicial meshes compactly while supporting online queries and updates efficiently. Our data structure requires about a factor of fi...
Daniel K. Blandford, Guy E. Blelloch, David E. Car...
TACAS
2007
Springer
74views Algorithms» more  TACAS 2007»
16 years 26 days ago
Shape Analysis by Graph Decomposition
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
Roman Manevich, Josh Berdine, Byron Cook, G. Ramal...
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 8 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
15 years 5 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola