4541 search results - page 318 / 909 » Cache-Oblivious Algorithms and Data Structures |
113
click to vote
PPSC
1997
15 years 5 months ago
1997
We present an overview of algorithms and data structures for dynamic re nement coarsening adaptation of unstructured FE meshes on loosely coupled parallel processors. We describ...
146
click to vote
GIR
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
125
click to vote
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
160
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
146
click to vote
FUN
2010
Springer
15 years 7 months ago
2010
Springer
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...