1332 search results - page 31 / 267 » Combinatorial Algorithms |
ICASSP
2009
IEEE
14 years 3 months ago
2009
IEEE
This paper is concerned with the problem of computing a discretecoefficient approximation to a digital filter. In contrast to earlier works that have approached this problem usi...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations. We propose a new automated system for se...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
DAM
2006
13 years 9 months ago
2006
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...