Sciweavers

529 search results - page 6 / 106
» Query Processing for Distance Metrics
Sort
View
ICASSP
2008
IEEE
14 years 4 months ago
Density geodesics for similarity clustering
We address the problem of similarity metric selection in pairwise affinity clustering. Traditional techniques employ standard algebraic context-independent sample-distance measur...
Umut Ozertem, Deniz Erdogmus, Miguel Á. Car...
SIGIR
2010
ACM
13 years 10 months ago
Generalized syntactic and semantic models of query reformulation
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
Amac Herdagdelen, Massimiliano Ciaramita, Daniel M...
TKDE
2010
195views more  TKDE 2010»
13 years 8 months ago
Query Processing Using Distance Oracles for Spatial Networks
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
Jagan Sankaranarayanan, Hanan Samet
EDBT
2011
ACM
225views Database» more  EDBT 2011»
13 years 1 months ago
On (not) indexing quadratic form distance by metric access methods
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...
Tomás Skopal, Tomás Bartos, Jakub Lo...
SPIRE
2005
Springer
14 years 3 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