1021 search results - page 38 / 205 » Fast Approximate PCPs |
108
click to vote
ARITH
2007
IEEE
15 years 5 months ago
2007
IEEE
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
165
click to vote
STOC
2012
ACM
13 years 4 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
124
Voted
CEAS
2006
Springer
15 years 5 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 ...
138
click to vote
TCOS
2010
15 years 7 days ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
111
click to vote
ICRA
2007
IEEE
15 years 8 months ago
2007
IEEE
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...