Sciweavers

224 search results - page 10 / 45
» G-graphs for the cage problem: a new upper bound
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
15 years 16 days ago
Counting Unique-Sink Orientations
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear compl...
Jan Foniok, Bernd Gärtner, Lorenz Klaus, Mark...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 9 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
TIT
2011
119views more  TIT 2011»
15 years 1 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer
CP
2011
Springer
14 years 5 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
ICCV
2009
IEEE
15 years 3 months ago
A robust boosting tracker with minimum error bound in a co-training framework
The varying object appearance and unlabeled data from new frames are always the challenging problem in object tracking. Recently machine learning methods are widely applied to tra...
Rong Liu, Jian Cheng, Hanqing Lu