4137 search results - page 119 / 828 » On the number of matchings of a tree |
204
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
167
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, we present a non-rigid quasi-dense matching method and its application to object recognition and segmentation. The matching method is based on the match propagation...
253
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
233
click to vote
ICCV
2005
IEEE
16 years 2 days ago
2005
IEEE
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...
152
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...