1101 search results - page 130 / 221 » Scalable Distributed Data Structures for High-Performance Da... |
188
Voted
PODS
1997
ACM
15 years 7 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...
116
Voted
DEXAW
1999
IEEE
15 years 7 months ago
1999
IEEE
The design of efficient textual similarities is an important issue in the domain of textual data exploration. Textual similarities are for example central in document collection s...
117
Voted
VLDB
2004
ACM
15 years 8 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
207
click to vote
VLDB
2004
ACM
16 years 3 months 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...
109
click to vote
ISPAN
1996
IEEE
15 years 7 months ago
1996
IEEE
In this paper, we have presented the design and evaluation of a compiler system, called APE,for automatic parallelization of scientific and engineering applications on distributed...