466 search results - page 39 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
190
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Object localization and classification are important problems in computer vision.
However, in many applications, exhaustive search over all class labels and image
locations is co...
175
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
136
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
177
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
158
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...