Sciweavers

15 search results - page 3 / 3
» On the discrepancy of combinatorial rectangles
Sort
View
PAMI
2006
107views more  PAMI 2006»
13 years 7 months ago
Custom-Built Moments for Edge Location
We present a general construction of functions whose moments serve to locate and parametrize step edges within an image. Previous use of moments to locate edges was limited to func...
Irina Popovici, William Douglas Withers
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
COR
2006
98views more  COR 2006»
13 years 7 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
JAL
1998
85views more  JAL 1998»
13 years 6 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 20 days ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy