3875 search results - page 508 / 775 » Approximation algorithms for the 0-extension problem |
209
Voted
JAIR
2008
15 years 6 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
189
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Large margin learning of Continuous Density HMMs with a partially labeled dataset has been extensively studied in the speech and handwriting recognition fields. Yet due to the non...
198
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
It has been shown that the 3D shape of a deformable surface in an image can be recovered by establishing correspondences between that image and a reference one in which the shape ...
164
click to vote
DGCI
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...
167
click to vote
ESA
2003
Springer
15 years 12 months ago
2003
Springer
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...