4850 search results - page 151 / 970 » Approximate Data Structures with Applications |
110
Voted
ICDE
2010
IEEE
16 years 18 days ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
149
click to vote
ESA
2007
Springer
15 years 7 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
111
Voted
FSS
2007
15 years 24 days ago
2007
In Analytic Hierarchy Process (AHP) structured hierarchically as several criteria and alternatives, the priority of an alternative is obtained by using the pairwise comparisons ba...
94
Voted
SNPD
2003
15 years 2 months ago
2003
This paper focuses on non-strict processing, optimization, and partial evaluation of MPI programs which use incremental data structures (ISs). We describe the design and implement...
179
click to vote
VLDB
2004
ACM
16 years 1 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...