Sciweavers

1190 search results - page 37 / 238
» On the Structure of Syntenic Distance
Sort
View
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 10 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
ICIP
2010
IEEE
13 years 8 months ago
Earth Mover Distance on superpixels
Earth Mover Distance (EMD) is a popular distance to compute distances between Probability Density Functions (PDFs). It has been successfully applied in a wide selection of problem...
Sylvain Boltz, Frank Nielsen, Stefano Soatto
ICCV
2007
IEEE
14 years 12 months ago
Localizing Unordered Panoramic Images Using the Levenshtein Distance
This paper proposes a feature-based method for recovering the relative positions of the viewpoints of a set of panoramic images for which no a priori order information is availabl...
Damien Michel, Antonis A. Argyros, Manolis I. A. L...
ICIP
2004
IEEE
14 years 11 months ago
A new similarity measure using hausdorff distance map
Image dissimilarity measure is a hot topic. The measure process is generally composed of an information mining in each image which results in an image signature and then a signatu...
Etienne Baudrier, Frédéric Nicolier,...
ADBIS
2003
Springer
95views Database» more  ADBIS 2003»
14 years 3 months ago
Distance Join Queries of Multiple Inputs in Spatial Databases
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...