4302 search results - page 177 / 861 » Index Pairs Algorithms |
89
Voted
ICALP
2009
Springer
16 years 29 days ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
179
click to vote
VLDB
2004
ACM
16 years 27 days ago
2004
ACM
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
74
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
AS-Index is a new index structure for exact string search in disk resident databases. It uses hashing, unlike known alternate structures, tree or trie based, and indexes every n-g...
116
Voted
ICCS
2007
Springer
15 years 6 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 ...
90
Voted
SIGIR
2006
ACM
15 years 6 months ago
2006
ACM
Large-scale web and text retrieval systems deal with amounts of data that greatly exceed the capacity of any single machine. To handle the necessary data volumes and query through...