4536 search results - page 117 / 908 » Contention-Sensitive Data Structures and Algorithms |
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
AUSDM
2006
Springer
14 years 27 days ago
2006
Springer
When different subsamples of the same data set are used to induce classification trees, the structure of the built classifiers is very different. The stability of the structure of ...
BNCOD
2007
13 years 10 months ago
2007
We present a novel framework for indexing and searching schema-less XML documents based on concise summaries of their structural and textual content. Our search query language is X...
CC
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
SODA
2010
ACM
13 years 7 months ago
2010
ACM
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...