1461 search results - page 29 / 293 » The Cost of Cache-Oblivious Searching |
119
click to vote
DAMON
2009
Springer
15 years 26 days ago
2009
Springer
This paper presents novel tree-based search algorithms that exploit the SIMD instructions found in virtually all modern processors. The algorithms are a natural extension of binar...
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Indexes for large collections are often divided into shards that are distributed across multiple computers and searched in parallel to provide rapid interactive search. Typically,...
108
click to vote
CSCLP
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
105
click to vote
PVLDB
2008
14 years 11 months ago
2008
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
117
click to vote
DEXA
2010
Springer
14 years 9 months ago
2010
Springer
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...