Sciweavers

244 search results - page 21 / 49
» Analyzing the performance of randomized information sharing
Sort
View
IPSN
2004
Springer
14 years 2 months ago
Estimation from lossy sensor data: jump linear modeling and Kalman filtering
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...
Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal
TON
2002
175views more  TON 2002»
13 years 8 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
INFOCOM
2006
IEEE
14 years 3 months ago
Capacity of Wireless Data Networks with Intra- and Inter-Cell Mobility
— The performance of wireless data systems has been thoroughly studied in the context of a single base station. In the present paper we analyze networks with several interacting ...
Sem C. Borst, Alexandre Proutiére, Nidhi He...
IOPADS
1997
152views more  IOPADS 1997»
13 years 10 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
IDA
2009
Springer
13 years 6 months ago
Hierarchical Extraction of Independent Subspaces of Unknown Dimensions
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...
Peter Gruber, Harold W. Gutch, Fabian J. Theis