Sciweavers

1885 search results - page 157 / 377
» Distance Map Retrieval
Sort
View
141
Voted
SSD
2005
Springer
153views Database» more  SSD 2005»
15 years 9 months ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...
135
Voted
SIGIR
2008
ACM
15 years 3 months ago
A bayesian logistic regression model for active relevance feedback
Relevance feedback, which traditionally uses the terms in the relevant documents to enrich the user's initial query, is an effective method for improving retrieval performanc...
Zuobing Xu, Ram Akella
VLSISP
2010
254views more  VLSISP 2010»
15 years 1 months ago
Manifold Based Local Classifiers: Linear and Nonlinear Approaches
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...
105
Voted
MM
2005
ACM
134views Multimedia» more  MM 2005»
15 years 9 months ago
Formulating context-dependent similarity functions
Tasks of information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be formulated in a con...
Gang Wu, Edward Y. Chang, Navneet Panda
169
Voted
SPIRE
2005
Springer
15 years 9 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez