2957 search results - page 171 / 592 » The Complexity of Polynomial-Time Approximation |
198
Voted
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
189
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
165
click to vote
JMLR
2010
15 years 27 days ago
2010
We consider the problem of correcting the posterior marginal approximations computed by expectation propagation and Laplace approximation in latent Gaussian models and propose cor...
209
click to vote
ISCAS
2007
IEEE
16 years 12 days ago
2007
IEEE
— We present a novel way of approximating FIR filters by IIR structures through generalizing the vector fitting (VF) algorithm, popularly used in continuous-time frequency-doma...
157
Voted
MOBIHOC
2007
ACM
16 years 5 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...