Sciweavers

91 search results - page 11 / 19
» A supertree method for rooted trees
Sort
View
IPL
1998
119views more  IPL 1998»
15 years 1 days ago
A 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Sunil Arya, H. Ramesh
CSB
2003
IEEE
130views Bioinformatics» more  CSB 2003»
15 years 5 months ago
Latent Structure Models for the Analysis of Gene Expression Data
Cluster methods have been successfully applied in gene expression data analysis to address tumor classification. By grouping tissue samples into homogeneous subsets, more systema...
Dong Hua, Dechang Chen, Xiuzhen Cheng, Abdou Youss...
77
Voted
ICCV
2009
IEEE
16 years 5 months ago
Context by Region Ancestry
In this paper, we introduce a new approach for modeling visual context. For this purpose, we consider the leaves of a hierarchical segmentation tree as elementary units. Each le...
Joseph J. Lim, Pablo Arbelaez, Chunhui Gu, and Jit...
122
Voted
HUMO
2007
Springer
15 years 4 months ago
Efficient Upper Body Pose Estimation from a Single Image or a Sequence
We propose a method to find candidate 2D articulated model configurations by searching for locally optimal configurations under a weak but computationally manageable fitness functi...
Matheen Siddiqui, Gérard G. Medioni
SIGPRO
2002
114views more  SIGPRO 2002»
15 years 11 hour ago
Error resilience and recovery in streaming of embedded video
The three-dimensional (3-D) SPIHT coder is a scalable or embedded coder that has proved its efficiency and its real-time capability in compression of video. A forward-error-correc...
Sungdae Cho, William A. Pearlman