Sciweavers

56 search results - page 2 / 12
» Tree Distance and Some Other Variants of Evalb
Sort
View
CLASSIFICATION
2006
103views more  CLASSIFICATION 2006»
13 years 5 months ago
On the Complexity of Ordinal Clustering
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
Rahul Shah, Martin Farach-Colton
ICCV
2005
IEEE
14 years 7 months ago
Beyond Trees: Common-Factor Models for 2D Human Pose Recovery
Tree structured models have been widely used for determining the pose of a human body, from either 2D or 3D data. While such models can effectively represent the kinematic constra...
Xiangyang Lan, Daniel P. Huttenlocher
CIAC
1997
Springer
154views Algorithms» more  CIAC 1997»
13 years 9 months ago
Isomorphism for Graphs of Bounded Distance Width
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fl...
BMCBI
2006
137views more  BMCBI 2006»
13 years 5 months ago
Genome BLAST distance phylogenies inferred from whole plastid and whole mitochondrion genome sequences
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
Alexander F. Auch, Stefan R. Henz, Barbara R. Holl...
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 5 days ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon