Sciweavers

1105 search results - page 180 / 221
» Linear choosability of graphs
Sort
View
CATS
2008
14 years 11 months ago
Tractable Cases of the Extended Global Cardinality Constraint
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
Marko Samer, Stefan Szeider
ICML
2010
IEEE
14 years 10 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
CORR
2010
Springer
190views Education» more  CORR 2010»
14 years 9 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
CN
2006
70views more  CN 2006»
14 years 9 months ago
Preventing persistent oscillations and loops in IBGP configuration with route reflection
Abstract-- Internal Border Gateway Protocol (IBGP) is responsible for distributing external reachability information, obtained via External-BGP (EBGP) sessions, within an autonomou...
Anuj Rawat, Mark A. Shayman
PRL
2010
188views more  PRL 2010»
14 years 8 months ago
Sparsity preserving discriminant analysis for single training image face recognition
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
Lishan Qiao, Songcan Chen, Xiaoyang Tan