1632 search results - page 185 / 327 » Sublinear Time Algorithms for Metric Space Problems |
136
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
134
click to vote
PCI
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...
120
click to vote
ICCD
2005
IEEE
16 years 1 months ago
2005
IEEE
Recent studies have shown that in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large,...
124
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
137
click to vote
AR
2007
15 years 4 months ago
2007
—Reinforcement learning is the scheme for unsupervised learning in which robots are expected to acquire behavior skills through self-explorations based on reward signals. There a...