6110 search results - page 75 / 1222 » Approximate Computing |
136
click to vote
SSDBM
2007
IEEE
15 years 9 months ago
2007
IEEE
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
138
Voted
AIRWEB
2008
Springer
15 years 4 months ago
2008
Springer
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...
123
Voted
TCS
2008
15 years 2 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
138
Voted
ICTAI
2008
IEEE
15 years 9 months ago
2008
IEEE
—The dynamics of many systems are described by ordinary differential equations (ODE). Solving ODEs with standard methods (i.e. numerical integration) needs a high amount of compu...
111
click to vote
COMGEO
2010
ACM
15 years 2 months ago
2010
ACM
We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...