184 search results - page 24 / 37 » Cache-oblivious data structures for orthogonal range searchi... |
194
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
106
click to vote
BERTINORO
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we present and evaluate uncoordinated on-line algorithms for simultaneous storage and replication load-balancing in DHT-based peer-to-peer systems. We compare our ap...
120
click to vote
ICDM
2002
IEEE
15 years 4 months ago
2002
IEEE
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
ICDT
2001
ACM
15 years 4 months ago
2001
ACM
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...