2957 search results - page 182 / 592 » The Complexity of Polynomial-Time Approximation |
154
click to vote
NIPS
2004
15 years 7 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
141
click to vote
SIAMJO
2008
15 years 6 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
152
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...
137
Voted
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Current techniques used in pipelining recursive filters require significant hardware complexity. These techniques attempt to preserve the exact frequency response of the origina...
144
Voted
DAC
1996
ACM
15 years 10 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...