11394 search results - page 68 / 2279 » Self-Organizing Data Structures |
118
Voted
DAWAK
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a technique for discovering and representing changes between versions of data warehouse structures. We select a tree comparison algorithm, adapt it for the par...
167
click to vote
RSA
2006
15 years 3 months ago
2006
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
111
click to vote
POPL
1998
ACM
15 years 7 months ago
1998
ACM
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
110
Voted
STACS
2009
Springer
15 years 10 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...
115
Voted
IWPC
2006
IEEE
15 years 9 months 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...