Sciweavers

1056 search results - page 74 / 212
» Constraint-Based Graph Matching
Sort
View
JAL
2006
101views more  JAL 2006»
13 years 9 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
COLING
2010
13 years 4 months ago
Automatic analysis of semantic similarity in comparable text through syntactic tree matching
We propose to analyse semantic similarity in comparable text by matching syntactic trees and labeling the alignments according to one of five semantic similarity relations. We pre...
Erwin Marsi, Emiel Krahmer
IPMI
2011
Springer
13 years 16 days ago
Fast Brain Matching with Spectral Correspondence
Abstract. Brain matching is an important problem in neuroimaging studies. Current surface-based methods for cortex matching and atlasing, although quite accurate, can require long ...
Herve Lombaert, Leo Grady, Jonathan R. Polimeni, F...
ICIP
2006
IEEE
14 years 10 months ago
Virtual Craniofacial Reconstruction from Computed Tomography Image Sequences Exhibiting Multiple Fractures
A novel procedure for in-silico (virtual) craniofacial reconstruction of human mandibles with multiple fractures from a sequence of Computed Tomography (CT) images is presented. T...
Ananda S. Chowdhury, Suchendra M. Bhandarkar, Robe...
JCT
2007
93views more  JCT 2007»
13 years 9 months ago
Generating bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that...
Serguei Norine, Robin Thomas