IPPS
2006
IEEE
14 years 4 months ago
2006
IEEE
Protein sequences with unknown functionality are often compared to a set of known sequences to detect functional similarities. Efficient dynamic programming algorithms exist for t...
ISVC
2007
Springer
14 years 5 months ago
2007
Springer
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
ICASSP
2009
IEEE
14 years 5 months ago
2009
IEEE
In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim’s algorithm. Firstly, we use polygonal approxi...
CC
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. This paper presents four extensions to the Interprocedural Finite Distributive Subset (IFDS) algorithm that make it applicable to a wider class of analysis problems. IFDS...
RECOMB
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
ECCV
2000
Springer
15 years 21 days ago
2000
Springer
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
ECCV
2006
Springer
15 years 22 days ago
2006
Springer
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...