Sciweavers

529 search results - page 75 / 106
» Query Processing for Distance Metrics
Sort
View
SIGMOD
2003
ACM
237views Database» more  SIGMOD 2003»
16 years 2 months ago
Qcluster: Relevance Feedback Using Adaptive Clustering for Content-Based Image Retrieval
The learning-enhanced relevance feedback has been one of the most active research areas in content-based image retrieval in recent years. However, few methods using the relevance ...
Deok-Hwan Kim, Chin-Wan Chung
DEBU
2010
170views more  DEBU 2010»
15 years 2 months ago
Roads Belong in Databases
The popularity of location-based services and the need to perform real-time processing on them has led to an interest in queries on road networks, such as finding shortest paths a...
Jagan Sankaranarayanan, Hanan Samet
GEOINFORMATICA
2007
223views more  GEOINFORMATICA 2007»
15 years 1 months ago
Algorithms for Nearest Neighbor Search on Moving Object Trajectories
Nearest Neighbor (NN) search has been in the core of spatial and spatiotemporal database research during the last decade. The literature on NN query processing algorithms so far d...
Elias Frentzos, Kostas Gratsias, Nikos Pelekis, Ya...
109
Voted
VLDB
2007
ACM
139views Database» more  VLDB 2007»
15 years 8 months ago
A Bayesian Method for Guessing the Extreme Values in a Data Set
For a large number of data management problems, it would be very useful to be able to obtain a few samples from a data set, and to use the samples to guess the largest (or smalles...
Mingxi Wu, Chris Jermaine
CIKM
2010
Springer
15 years 16 days ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...