210 search results - page 35 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
WEBDB
2005
Springer
14 years 28 days ago
2005
Springer
Efficient querying XML documents is an increasingly important issue considering the fact that XML becomes the de facto standard for data representation and exchange over the Web,...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
COMPGEOM
2004
ACM
14 years 27 days 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...