Sciweavers

604 search results - page 13 / 121
» The Hardness of Metric Labeling
Sort
View
IDEAL
2007
Springer
14 years 2 months ago
A New Dissimilarity Measure Between Trees by Decomposition of Unit-Cost Edit Distance
Abstract. Tree edit distance is a conventional dissimilarity measure between labeled trees. However, tree edit distance including unit-cost edit distance contains the similarity of...
Hisashi Koga, Hiroaki Saito, Toshinori Watanabe, T...
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
14 years 8 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
ICML
2009
IEEE
14 years 8 months ago
Learning instance specific distances using metric propagation
In many real-world applications, such as image retrieval, it would be natural to measure the distances from one instance to others using instance specific distance which captures ...
De-Chuan Zhan, Ming Li, Yu-Feng Li, Zhi-Hua Zhou
AAAI
2010
13 years 9 months ago
Assisting Users with Clustering Tasks by Combining Metric Learning and Classification
Interactive clustering refers to situations in which a human labeler is willing to assist a learning algorithm in automatically clustering items. We present a related but somewhat...
Sumit Basu, Danyel Fisher, Steven M. Drucker, Hao ...
ICPR
2008
IEEE
14 years 2 months ago
Applying similarity metrics to 3D acquisition in structured-light systems
Structured light systems use projected light to augment a scene with extra information. The goal of such systems is often the recovery of depth information based on 2D image(s) fr...
Graylin T. Jay, Randy Smith