Sciweavers

9 search results - page 1 / 2
» Cyclic Labellings with Constraints at Two Distances
Sort
View
COMBINATORICS
2004
58views more  COMBINATORICS 2004»
13 years 10 months ago
Cyclic Labellings with Constraints at Two Distances
R. A. Leese, S. D. Noble
ESA
1998
Springer
175views Algorithms» more  ESA 1998»
14 years 3 months ago
Computing the Edit-Distance between Unrooted Ordered Trees
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
Philip N. Klein
CVPR
2012
IEEE
12 years 1 months ago
Large scale metric learning from equivalence constraints
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...
Martin Köstinger, Martin Hirzer, Paul Wohlhar...
ICCV
2005
IEEE
14 years 4 months ago
Robust Point Matching for Two-Dimensional Nonrigid Shapes
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
Yefeng Zheng, David S. Doermann
CVPR
2004
IEEE
15 years 26 days ago
A Discriminative Learning Framework with Pairwise Constraints for Video Object Classification
In video object classification, insufficient labeled data may at times be easily augmented with pairwise constraints on sample points, i.e, whether they are in the same class or n...
Rong Yan, Jian Zhang, Jie Yang, Alexander G. Haupt...