3874 search results - page 267 / 775 » Approximation Algorithms for k-hurdle Problems |
159
click to vote
JAIR
2008
15 years 4 months ago
2008
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
105
click to vote
ICIP
2007
IEEE
16 years 6 months ago
2007
IEEE
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
184
click to vote
GEOINFO
2007
15 years 5 months ago
2007
The problem of matching strings allowing errors has recently gained importance, considering the increasing volume of online textual data. In geotechnologies, approximate string mat...
163
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
159
click to vote
AIMSA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...