1332 search results - page 248 / 267 » Combinatorial Algorithms |
POPL
2010
ACM
14 years 5 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we present a surprisingly simple yet powerful method for detecting illumination--determining which pixels are lit by different lights--in images. Our method is based...
DAC
2001
ACM
14 years 8 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...