11212 search results - page 242 / 2243 » Semi-persistent Data Structures |
146
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
152
click to vote
IWPC
2006
IEEE
16 years 16 days ago
2006
IEEE
Analysis of dynamic data structure usage is useful for both program understanding and for improving the accuracy of other program analyses. Static analysis techniques, however, su...
159
click to vote
ISCIS
2005
Springer
16 years 1 days ago
2005
Springer
We introduce a novel data structure for solving the range query problem in generic metric spaces. It can be seen as a dynamic version of the List of Clusters data structure of Ch´...
246
click to vote
Lecture Notes
"The study of data structures and the algorithms that manipulate them is among the most fundamental topics in computer science. Most of what computer systems spend their time ...
215
click to vote
ACSC
2007
IEEE
16 years 27 days ago
2007
IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...