Sciweavers

193 search results - page 4 / 39
» Partial Solutions with Unique Completion
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
A closed-form solution to uncalibrated photometric stereo via diffuse maxima
In this paper we propose a novel solution to uncalibrated photometric stereo. Our approach is to eliminate the socalled generalized bas relief (GBR) ambiguity by exploiting points...
Paolo Favaro, Thoma Papadhimitri
ICTAI
1996
IEEE
13 years 11 months ago
Incremental Markov-Model Planning
This paper presents an approach to building plans using partially observable Markov decision processes. The approach begins with a base solution that assumes full observability. T...
Richard Washington
AAAI
1997
13 years 8 months ago
Abductive Completion of Plan Sketches
Most work on AI planning has focused on the development of fully automated methods for generating plans that satisfy user-speci ed goals. However, users in many domains want the a...
Karen L. Myers
VLDB
2005
ACM
133views Database» more  VLDB 2005»
14 years 28 days ago
Caching with 'Good Enough' Currency, Consistency, and Completeness
SQL extensions that allow queries to explicitly specify data quality requirements in terms of currency and consistency were proposed in an earlier paper. This paper develops a dat...
Hongfei Guo, Per-Åke Larson, Raghu Ramakrish...
ECML
2007
Springer
14 years 1 months ago
Safe Q-Learning on Complete History Spaces
In this article, we present an idea for solving deterministic partially observable markov decision processes (POMDPs) based on a history space containing sequences of past observat...
Stephan Timmer, Martin Riedmiller