Sciweavers

785 search results - page 21 / 157
» The Dynamic Bloom Filters
Sort
View
SIGCOMM
1996
ACM
13 years 11 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
ICML
2009
IEEE
14 years 8 months ago
Analytic moment-based Gaussian process filtering
We propose an analytic moment-based filter for nonlinear stochastic dynamic systems modeled by Gaussian processes. Exact expressions for the expected value and the covariance matr...
Marc Peter Deisenroth, Marco F. Huber, Uwe D. Hane...
JNSM
2007
138views more  JNSM 2007»
13 years 7 months ago
High-Speed Dynamic Packet Filtering
One problem encountered while monitoring gigabit networks, is the need to filter only those packets that are interesting for a given task while ignoring the others. Popular packet...
Luca Deri
UAI
2000
13 years 9 months ago
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Particle filters (PFs) are powerful samplingbased inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of prob...
Arnaud Doucet, Nando de Freitas, Kevin P. Murphy, ...
ICDE
2008
IEEE
118views Database» more  ICDE 2008»
14 years 9 months ago
XML processing in DHT networks
We study the scalable management of XML data in P2P networks based on distributed hash tables (DHTs). We identify performance limitations in this context, and propose an array of t...
Serge Abiteboul, Ioana Manolescu, Neoklis Polyzoti...