85 search results - page 11 / 17 » Generalized approximate counting revisited |
SIGMETRICS
2008
ACM
13 years 8 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The floating-point implementation of a function often reduces to a polynomial approximation on an interval. Remez algorithm provides the polynomial closest to the function, but th...
PE
2008
Springer
13 years 8 months ago
2008
Springer
We have proposed a three-parameter renewal approximation to analyze splitting and superposition of autocorrelated processes. We define the index of dispersion for counts of an ord...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
WWW
2001
ACM
14 years 9 months ago
2001
ACM
Mobile software agents are an increasingly important programming model within the World Wide Web (WWW). Typically programmed in Java or another machine- independent language, the ...