Sciweavers

824 search results - page 9 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
MIR
2005
ACM
115views Multimedia» more  MIR 2005»
14 years 1 months ago
Inferring similarity between music objects with application to playlist generation
The growing libraries of multimedia objects have increased the need for applications that facilitate search, browsing, discovery, recommendation and playlist construction. Many of...
Robert Ragno, Christopher J. C. Burges, Cormac Her...
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
13 years 9 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
CVPR
2001
IEEE
14 years 9 months ago
Bending Invariant Representations for Surfaces
Isometric surfaces share the same geometric structure also known as the `first fundamental form'. For example, all possible bending of a given surface, that include all lengt...
Asi Elad (Elbaz), Ron Kimmel
DASFAA
2006
IEEE
183views Database» more  DASFAA 2006»
14 years 1 months ago
Probabilistic Similarity Join on Uncertain Data
An important database primitive for commonly used feature databases is the similarity join. It combines two datasets based on some similarity predicate into one set such that the n...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...