1888 search results - page 173 / 378 » Algorithms for Querying by Spatial Structure |
231
Voted
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
223
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
155
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
142
click to vote
VISUALIZATION
1998
IEEE
15 years 8 months ago
1998
IEEE
In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space req...
227
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...