56 search results - page 2 / 12 » On the connections between PCTL and dynamic programming |
MVA
1998
13 years 8 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
AAAI
2006
13 years 8 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
ICALP
2010
Springer
14 years 7 days ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
XML has become one of the core technologies for contemporary business applications, especially web-based applications. To facilitate processing of diverse XML data, we propose an ...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...