Sciweavers

1105 search results - page 165 / 221
» Linear choosability of graphs
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
14 years 7 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
SIAMDM
2011
14 years 6 months ago
Origins of Nonlinearity in Davenport-Schinzel Sequences
Abstract. A generalized Davenport–Schinzel sequence is one over a finite alphabet that excludes subsequences isomorphic to a fixed forbidden subsequence. The fundamental proble...
Seth Pettie
MP
2010
163views more  MP 2010»
14 years 6 months ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Christoph Buchheim, Frauke Liers, Marcus Oswald

Book
519views
16 years 11 months ago
Information Theory, Inference, and Learning Algorithms
This book is aimed at senior undergraduates and graduate students in Engineering, Science, Mathematics, and Computing. It expects familiarity with calculus, probability theory, and...
David J. C. MacKay
ICCV
2009
IEEE
1234views Computer Vision» more  ICCV 2009»
16 years 4 months ago
Human Pose Estimation Using Consistent Max-Covering
We propose a novel consistent max-covering scheme for human pose estimation. Consistent max-covering formulates pose estimation as the covering of body part polygons on an objec...
Hao Jiang