Sciweavers

2421 search results - page 169 / 485
» Approximate Flow-Aware Networking
Sort
View
156
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
212
Voted
ICDE
2005
IEEE
115views Database» more  ICDE 2005»
16 years 4 months ago
Snapshot Queries: Towards Data-Centric Sensor Networks
In this paper we introduce the idea of snapshot queries for energy efficient data acquisition in sensor networks. Network nodes generate models of their surrounding environment th...
Yannis Kotidis
126
Voted
IJCNN
2006
IEEE
15 years 9 months ago
Studies on the Memory Capacity and Robustness of Chaotic Dynamic Neural Networks
- A dynamical neural model that is strongly biologically motivated is applied to learning and retrieving binary patterns. This neural network, known as Freeman’s Ksets, is traine...
Igor Beliaev, Robert Kozma
141
Voted
QEST
2006
IEEE
15 years 9 months ago
Measuring and Modeling of Application Flow Length in Commercial GPRS Networks
New mobile access networks provide reasonable high bandwidth to allow true internet access. This paper models two dominant applications of those networks. One application, WAP, is...
Roger Kalden, Boudewijn R. Haverkort
102
Voted
IPSN
2004
Springer
15 years 8 months ago
A probabilistic approach to inference with limited information in sensor networks
We present a methodology for a sensor network to answer queries with limited and stochastic information using probabilistic techniques. This capability is useful in that it allows...
Rahul Biswas, Sebastian Thrun, Leonidas J. Guibas