Sciweavers

125 search results - page 7 / 25
» The Complexity of Rooted Phylogeny problems
Sort
View
CVPR
2003
IEEE
14 years 9 months ago
An Efficient Solution to the Five-Point Relative Pose Problem
An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera motion between ...
David Nistér
RECOMB
1997
Springer
13 years 11 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
BMCBI
2010
177views more  BMCBI 2010»
13 years 7 months ago
Clustering of protein families into functional subtypes using Relative Complexity Measure with reduced amino acid alphabets
Background: Phylogenetic analysis can be used to divide a protein family into subfamilies in the absence of experimental information. Most phylogenetic analysis methods utilize mu...
Aydin Albayrak, Hasan H. Otu, Ugur O. Sezerman
ICCV
2005
IEEE
14 years 1 months ago
How Hard is 3-View Triangulation Really?
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
Henrik Stewénius, Frederik Schaffalitzky, D...
SSS
2005
Springer
14 years 1 months ago
A Snap-Stabilizing DFS with a Lower Space Requirement
Abstract. A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In [4], we presented the first snap-stab...
Alain Cournier, Stéphane Devismes, Vincent ...