41 search results - page 4 / 9 » Faster Deterministic Sorting and Searching in Linear Space |
SODA
1998
ACM
13 years 8 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
DSMML
2004
Springer
14 years 26 days ago
2004
Springer
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
SSDBM
2009
IEEE
14 years 2 months ago
2009
IEEE
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
COMPGEOM
1998
ACM
13 years 11 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...