Sciweavers

1056 search results - page 18 / 212
» Constraint-Based Graph Matching
Sort
View
EJC
2010
13 years 9 months ago
Perfect matchings with restricted intersection in cubic graphs
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
Tomás Kaiser, André Raspaud
ACCV
1998
Springer
14 years 1 months ago
Object Recognition by Matching Symbolic Edge Graphs
We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combi...
Tino Lourens, Rolf P. Würtz
CVPR
2008
IEEE
14 years 11 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
14 years 2 months ago
Distributed Weighted Matching
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
Mirjam Wattenhofer, Roger Wattenhofer
ICPR
2010
IEEE
14 years 9 days ago
Cell Tracking in Video Microscopy Using Bipartite Graph Matching
Automated visual tracking of cells from video microscopy has many important biomedical applications. In this paper, we model the problem of cell tracking over pairs of video micro...
Ananda Chowdhury, Rohit Chatterjee, Mayukh Ghosh, ...