Sciweavers

279 search results - page 20 / 56
» Matching Polynomials And Duality
Sort
View
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
13 years 12 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 5 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld
SSPR
2004
Springer
14 years 29 days ago
An Optimal Probabilistic Graphical Model for Point Set Matching
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
Tibério S. Caetano, Terry Caelli, Dante Aug...
PRL
2007
163views more  PRL 2007»
13 years 7 months ago
A model based approach for pose estimation and rotation invariant object matching
Pose estimation has been considered to be an important component in many pattern recognition and computer vision systems. In this paper, we introduce a pose estimation method base...
Cem Ünsalan
ICPR
2010
IEEE
13 years 11 months ago
Cell Tracking in Video Microscopy Using Bipartite Graph Matching
Automated visual tracking of cells from video microscopy has many important biomedical applications. In this paper, we model the problem of cell tracking over pairs of video micro...
Ananda Chowdhury, Rohit Chatterjee, Mayukh Ghosh, ...