Sciweavers

18 search results - page 1 / 4
» Fast, flexible filtering with phlat
Sort
View
CHI
2006
ACM
14 years 5 months ago
Fast, flexible filtering with phlat
Systems for fast search of personal information are rapidly becoming ubiquitous. Such systems promise to dramatically improve personal information management, yet most are modeled...
Edward Cutrell, Daniel C. Robbins, Susan T. Dumais...
SIGCOMM
1996
ACM
13 years 9 months ago
DPF: Fast, Flexible Message Demultiplexing Using Dynamic Code Generation
Fast and flexible message demultiplexing are well-established goals in the networking community [1, 18, 22]. Currently, however, network architects have had to sacrifice one for t...
Dawson R. Engler, M. Frans Kaashoek
IJACTAICIT
2010
127views more  IJACTAICIT 2010»
13 years 2 months ago
New Proposed Algorithms for nth Order Butterworth Active Filter Computer-Aided Design
This paper describes new proposed algorithms for constructing the transfer function of nth order Butterworth LPF using the idea of the cascade combination of active filters. Compu...
Haider Fakher Radhi Al-Saidy
FMCAD
2004
Springer
13 years 8 months ago
Bloom Filters in Probabilistic Verification
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
Peter C. Dillinger, Panagiotis Manolios
ICC
2008
IEEE
139views Communications» more  ICC 2008»
13 years 11 months ago
Enabling Flexible Packet Filtering Through Dynamic Code Generation
— Despite its efficiency, the general approach of hardcoding protocol format descriptions in packet processing applications suffers from many limitations. Among the others, the l...
Olivier Morandi, Fulvio Risso, Mario Baldi, Andrea...