2957 search results - page 352 / 592 » The Complexity of Polynomial-Time Approximation |
222
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
176
click to vote
CEAS
2006
Springer
15 years 10 months ago
2006
Springer
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
204
click to vote
UAI
2008
15 years 8 months ago
2008
Much recent work has concerned sparse approximations to speed up the Gaussian process regression from the unfavorable O(n3 ) scaling in computational time to O(nm2 ). Thus far, wo...
173
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility func...
168
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
The paper proposes a new wavelet-based Bayesian approach to image deconvolution, under the space-invariant blur and additive white Gaussian noise assumptions. Image deconvolution ...