1461 search results - page 6 / 293 » The Cost of Cache-Oblivious Searching |
134
click to vote
PODS
1997
ACM
15 years 1 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
69
Voted
ADBIS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...
JCDL
2009
ACM
15 years 4 months ago
2009
ACM
The utility of an enterprise search system is determined by three key players: the information retrieval (IR) system (the search engine), the enterprise users, and the service pro...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
IANDC
2008
14 years 9 months ago
2008
We investigate code trees and search trees with cost functions that increase exponentially with the depth in the tree. While corresponding coding theorems have been considered in ...