1632 search results - page 17 / 327 » Sublinear Time Algorithms for Metric Space Problems |
127
click to vote
TPDS
2002
15 years 2 months ago
2002
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...
108
Voted
WDAG
2005
Springer
15 years 8 months ago
2005
Springer
Transactional Memory is a concurrent programming API in which concurrent threads synchronize via transactions (instead of locks). Although this model has mostly been studied in the...
144
Voted
ICCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
103
click to vote
DATE
2004
IEEE
15 years 7 months ago
2004
IEEE
This paper presents an exploration algorithm which examines execution time and energy consumption of a given application, while considering a parameterized memory architecture. Th...
142
click to vote
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...