Sciweavers

2695 search results - page 28 / 539
» Learning Graph Matching
Sort
View
140
Voted
ML
2010
ACM
185views Machine Learning» more  ML 2010»
14 years 10 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal
146
Voted
ECCV
2004
Springer
16 years 5 months ago
Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickin...
138
Voted
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 3 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy
145
Voted
ICPR
2006
IEEE
16 years 4 months ago
Face Recognition by Expression-Driven Sketch Graph Matching
We present a novel face recognition method using automatically extracted sketch by a multi-layer grammatical face model. First, the observed face is parsed into a 3layer (face, pa...
Jiebo Luo, Zijian Xu
144
Voted
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
15 years 9 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...