2168 search results - page 76 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
142
click to vote
JAIR
2006
15 years 3 months ago
2006
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
120
click to vote
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
This work explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions...
138
Voted
DASFAA
2009
IEEE
15 years 10 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
144
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
116
Voted
JAIR
1998
15 years 3 months ago
1998
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...