558 search results - page 67 / 112 » Trees and Matchings |
BIBM
2008
IEEE
15 years 6 months ago
2008
IEEE
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
GBRPR
2007
Springer
15 years 6 months ago
2007
Springer
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...
112
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
DAM
2007
14 years 11 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
149
click to vote
GBRPR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This paper proposes an expert peering system for information exchange. Our objective is to develop a real-time search engine for an online community where users can ask e...