3875 search results - page 168 / 775 » Approximation algorithms for the 0-extension problem |
156
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...
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...
191
Voted
AI
2011
Springer
14 years 12 months 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...
150
Voted
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We present reductions from lattice problems in the 2 norm to the corresponding problems in other norms such as 1, (and in fact in any other p norm where 1 p ). We consider latt...
163
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...