466 search results - page 37 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
CP
2008
Springer
15 years 1 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
We study the task of object part extraction and labeling, which seeks to understand objects beyond simply identifiying their bounding boxes. We start from bottom-up segmentation of...
VLDB
2001
ACM
15 years 4 months ago
2001
ACM
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
CP
2006
Springer
15 years 3 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
155
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
A new data structure for efficient similarity search in very large datasets of high-dimensional vectors is introduced. This structure called the inverted multi-index generalizes ...