Sciweavers

1404 search results - page 115 / 281
» Optimization problems in multiple-interval graphs
Sort
View
PAMI
2006
156views more  PAMI 2006»
14 years 10 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann
BIOINFORMATICS
2008
119views more  BIOINFORMATICS 2008»
14 years 10 months ago
Optimal design of thermally stable proteins
Motivation: For many biotechnological purposes, it is desirable to redesign proteins to be more structurally and functionally stable at higher temperatures. For example, chemical ...
Ryan M. Bannen, Vanitha Suresh, George N. Phillips...
ICASSP
2010
IEEE
14 years 10 months ago
Shape matching based on graph alignment using hidden Markov models
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
Xiaoning Qian, Byung-Jun Yoon
ISAAC
2009
Springer
113views Algorithms» more  ISAAC 2009»
15 years 2 months ago
On Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
Yusuke Kobayashi, Christian Sommer 0002
MP
2011
14 years 5 months ago
Statistical ranking and combinatorial Hodge theory
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye