Sciweavers

4137 search results - page 286 / 828
» On the number of matchings of a tree
Sort
View
CVPR
2003
IEEE
16 years 8 months ago
Representation and Detection of Deformable Shapes
We describe some techniques that can be used to represent and detect deformable shapes in images. The main difficulty with deformable template models is the very large or infinite...
Pedro F. Felzenszwalb
ICPR
2006
IEEE
16 years 7 months ago
Convex Quadratic Programming for Object Localization
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very li...
Hao Jiang, Mark S. Drew, Ze-Nian Li
DMIN
2009
142views Data Mining» more  DMIN 2009»
15 years 4 months ago
Efficient Record Linkage using a Double Embedding Scheme
Record linkage is the problem of identifying similar records across different data sources. The similarity between two records is defined based on domain-specific similarity functi...
Noha Adly
124
Voted
GBRPR
2007
Springer
16 years 28 days ago
Graph-Based Methods for Retinal Mosaicing and Vascular Characterization
In this paper, we propose a highly robust point-matching method (Graph Transformation Matching - GTM) relying on finding the consensus graph emerging from putative matches. Such m...
Wendy Aguilar, M. Elena Martínez-Pér...
172
Voted
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
16 years 7 days ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
André Berger, Ojas Parekh