492 search results - page 23 / 99 » Fast data stream algorithms using associative memories |
SIGCOMM
2009
ACM
14 years 2 months ago
2009
ACM
As forwarding tables and link speeds continue to grow, fast packet forwarding becomes increasingly challenging for enterprise edge routers. Simply building routers with ever large...
CG
2007
Springer
13 years 7 months ago
2007
Springer
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
PODS
2003
ACM
14 years 7 months ago
2003
ACM
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
CSDA
2006
13 years 7 months ago
2006
Likelihood-based marginal regression modelling for repeated, or otherwise clustered, categorical responses is computationally demanding. This is because the number of measures nee...
JPDC
2008
13 years 7 months ago
2008
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...