2498 search results - page 175 / 500 » Data Structures with Unpredictable Timing |
COMPGEOM
2004
ACM
15 years 3 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...
IR
2008
14 years 10 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
127
Voted
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...
91
Voted
ACTAC
2008
14 years 10 months ago
2008
Rules provide an expressive means for implementing database behavior: They cope with changes and their ramifications. Rules are commonly used for integrity enforcement, i.e., for ...
100
Voted
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...