2957 search results - page 321 / 592 » The Complexity of Polynomial-Time Approximation |
219
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
245
click to vote
PODS
2006
ACM
16 years 7 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
201
click to vote
ICASSP
2009
IEEE
16 years 2 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...
202
click to vote
DATE
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
195
click to vote
GLOBECOM
2006
IEEE
16 years 1 months ago
2006
IEEE
— We propose an iterative receiver for horizontally encoded MIMO systems like the PARC proposal for MIMOHSDPA. Our receiver uses a K-best-MAP demodulator to provide the channel d...