466 search results - page 77 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
175
click to vote
UAI
2001
15 years 7 months ago
2001
We propose a new approach to value-directed belief state approximationfor POMDPs. The valuedirected model allows one to choose approximation methods for belief state monitoringtha...
141
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...
189
click to vote
ACL
2011
14 years 9 months ago
2011
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
185
click to vote
JMLR
2008
15 years 6 months ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
169
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
We study the problem of estimating the epipolar geometry
from apparent contours of smooth curved surfaces
with affine camera models. Since apparent contours are
viewpoint depend...