Sciweavers

1381 search results - page 30 / 277
» Fast Filtered Sampling
Sort
View
OSDI
2004
ACM
15 years 10 months ago
FFPF: Fairly Fast Packet Filters
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
Herbert Bos, Willem de Bruijn, Mihai-Lucian Criste...
88
Voted
CORR
2008
Springer
116views Education» more  CORR 2008»
14 years 9 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard
EVOW
2005
Springer
15 years 3 months ago
Design of Fast Multidimensional Filters Using Genetic Algorithms
A method for designing fast multidimensional filters using genetic algorithms is described. The filter is decomposed into component filters where coefficients can be sparsely sc...
Max Langer, Björn Svensson, Anders Brun, Mats...
81
Voted
ISLPED
2006
ACM
140views Hardware» more  ISLPED 2006»
15 years 4 months ago
L-CBF: a low-power, fast counting bloom filter architecture
—An increasing number of architectural techniques rely on hardware counting bloom filters (CBFs) to improve upon the enegy, delay and complexity of various processor structures. ...
Elham Safi, Andreas Moshovos, Andreas G. Veneris
ICIP
2005
IEEE
15 years 11 months ago
Discrete bandelets with geometric orthogonal filters
This paper describes the construction of second generation bandelet orthogonal bases. The decomposition on a bandelet basis is computed using a wavelet filter bank followed by ada...
Gabriel Peyré, Stéphane Mallat