Sciweavers

315 search results - page 17 / 63
» Eigenvalue bounds for independent sets
Sort
View
MFCS
1997
Springer
14 years 2 months ago
Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
Uwe Schöning
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
14 years 1 months ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi
ECAI
2006
Springer
14 years 1 months ago
Multi-Objective Propagation in Constraint Programming
Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy...
Emma Rollon, Javier Larrosa
DGCI
2008
Springer
13 years 11 months ago
Statistical Template Matching under Geometric Transformations
Abstract. We present a novel template matching framework for detecting geometrically transformed objects. A template is a simplified representation of the object of interest by a s...
Alexander Sibiryakov
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 10 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor