2695 search results - page 171 / 539 » Learning Graph Matching |
141
click to vote
SPAA
1993
ACM
15 years 7 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
136
click to vote
MSCS
2007
15 years 2 months ago
2007
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
165
click to vote
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
We present a new approach to matching graphs embedded in R2 or R3 . Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not req...
119
click to vote
SIROCCO
2010
15 years 4 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
102
click to vote
ICANN
2007
Springer
15 years 9 months ago
2007
Springer
Treatment of general structured information by neural networks is an emerging research topic. Here we show how representations for graphs preserving all the information can be devi...