3874 search results - page 204 / 775 » Approximation Algorithms for k-hurdle Problems |
121
click to vote
ISSAC
2004
Springer
15 years 9 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
133
click to vote
ALGOSENSORS
2010
Springer
15 years 2 months ago
2010
Springer
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
158
click to vote
JCSS
2008
15 years 3 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
118
click to vote
SAT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
119
Voted
NIPS
2007
15 years 5 months ago
2007
We present an efficient generalization of the sparse pseudo-input Gaussian process (SPGP) model developed by Snelson and Ghahramani [1], applying it to binary classification pro...