Sciweavers

255 search results - page 22 / 51
» Approximate matching of secondary structures
Sort
View
ICPR
2006
IEEE
14 years 1 months ago
Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure
A novel stereo matching algorithm is proposed that utilizes color segmentation on the reference image and a selfadapting matching score that maximizes the number of reliable corre...
Andreas Klaus, Mario Sormann, Konrad F. Karner
RECOMB
1998
Springer
14 years 3 days ago
The hierarchical organization of molecular structure computations
The task of computing molecular structure from combinations of experimental and theoretical constraints is expensive because of the large number of estimated parameters (the 3D co...
Cheng Che Chen, Jaswinder Pal Singh, Russ B. Altma...
ICALP
2011
Springer
12 years 11 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
PVLDB
2010
110views more  PVLDB 2010»
13 years 6 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...
CVPR
2009
IEEE
15 years 3 months ago
Stereo Matching in the Presence of Sub-Pixel Calibration Errors
Stereo matching commonly requires rectified images that are computed from calibrated cameras. Since all under- lying parametric camera models are only approximations, calibratio...
Heiko Hirschmüller, Stefan K. Gehrig