3874 search results - page 321 / 775 » Approximation Algorithms for k-hurdle Problems |
157
click to vote
SIAMMAX
2010
14 years 11 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
155
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
168
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
146
click to vote
JACM
2000
15 years 4 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
193
Voted
AI
2011
Springer
15 years 19 hour ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...