Sciweavers

179 search results - page 8 / 36
» Optimizing Computation of Recovery Plans for BPEL Applicatio...
Sort
View
ML
2002
ACM
143views Machine Learning» more  ML 2002»
14 years 9 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
ICCV
2007
IEEE
15 years 11 months ago
Convex Optimization for Deformable Surface 3-D Tracking
3?D shape recovery of non-rigid surfaces from 3?D to 2?D correspondences is an under-constrained problem that requires prior knowledge of the possible deformations. State-of-the-a...
Mathieu Salzmann, Richard Hartley, Pascal Fua
66
Voted
CVPR
2008
IEEE
15 years 11 months ago
Simultaneous image transformation and sparse representation recovery
Sparse representation in compressive sensing is gaining increasing attention due to its success in various applications. As we demonstrate in this paper, however, image sparse rep...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
AI
2011
Springer
14 years 4 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
NCA
2007
IEEE
14 years 9 months ago
A computational strategy exploiting genetic algorithms to recover color surface reflectance functions
—Information about the spectral reflectance of a color surface is useful in many applications. Assuming that reflectance functions can be adequately approximated by a linear comb...
Raimondo Schettini, Silvia Zuffi