780 search results - page 39 / 156 » Cost-Sharing Approximations for h |
MOC
1998
13 years 7 months ago
1998
In this paper we discuss the collocation method for a large class of Fredholm linear integro-differential equations. It will be shown that, when a certain higher order interpolati...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
JUCS
2008
13 years 7 months ago
2008
: We address the problems of structuring and annotation of layout-oriented documents. We model the annotation problems as the collective classification on graph-like structures wit...
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
User generated spoken audio remains a challenge for Automatic Speech Recognition (ASR) technology and content-based audio surrogates derived from ASR-transcripts must be error rob...