Sciweavers

1132 search results - page 110 / 227
» Similarity Graphs
Sort
View
PAMI
2010
139views more  PAMI 2010»
14 years 8 months ago
Order-Preserving Moves for Graph-Cut-Based Optimization
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu
CVPR
2007
IEEE
15 years 12 months ago
Image Matching via Saliency Region Correspondences
We introduce the notion of co-saliency for image matching. Our matching algorithm combines the discriminative power of feature correspondences with the descriptive power of matchi...
Alexander Toshev, Jianbo Shi, Kostas Daniilidis
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
15 years 3 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
ICALP
2007
Springer
15 years 4 months ago
Parameterized Algorithms for Directed Maximum Leaf Problems
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
ICML
2003
IEEE
15 years 10 months ago
Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
Xiaojin Zhu, Zoubin Ghahramani, John D. Lafferty