2354 search results - page 189 / 471 » Randomness, Stochasticity and Approximations |
STOC
2003
ACM
14 years 10 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
ISSAC
2007
Springer
14 years 3 months ago
2007
Springer
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in [x, y]. Given a composite polyno...
JGAA
2007
13 years 9 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
COLT
2010
Springer
13 years 7 months ago
2010
Springer
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...