Sciweavers

1199 search results - page 78 / 240
» Robust inference of trees
Sort
View
ISAAC
2009
Springer
147views Algorithms» more  ISAAC 2009»
15 years 10 months ago
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
STOC
1996
ACM
92views Algorithms» more  STOC 1996»
15 years 8 months ago
Constructing Evolutionary Trees in the Presence of Polymorphic Characters
Abstract. Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states...
Maria Luisa Bonet, Cynthia A. Phillips, Tandy Warn...
115
Voted
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
15 years 5 months ago
On contract-and-refine transformations between phylogenetic trees
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy ...
ICCV
2009
IEEE
1957views Computer Vision» more  ICCV 2009»
16 years 9 months ago
Robust Visual Tracking using L1 Minimization
In this paper we propose a robust visual tracking method by casting tracking as a sparse approximation problem in a particle filter framework. In this framework, occlusion, corru...
Xue Mei, Haibin Ling
ICPR
2002
IEEE
16 years 5 months ago
Interacting Multiple Model (IMM) Kalman Filters for Robust High Speed Human Motion Tracking
Accurate and robust tracking of humans is of growing interest in the image processing and computer vision communities. The ability of a vision system to track the subjects and acc...
Michael E. Farmer, Rein-Lien Hsu, Anil K. Jain