15 search results - page 3 / 3 » On the discrepancy of combinatorial rectangles |
PAMI
2006
13 years 5 months ago
2006
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...
CPAIOR
2008
Springer
13 years 7 months ago
2008
Springer
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...
COR
2006
13 years 5 months ago
2006
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...
JAL
1998
13 years 5 months ago
1998
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...
COCO
2005
Springer
13 years 11 months ago
2005
Springer
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...