Sciweavers

1783 search results - page 333 / 357
» Low-Complexity Distributed Scheduling Algorithms for Wireles...
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 5 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
MOBISYS
2009
ACM
16 years 2 months ago
Fidelity-aware replication for mobile devices
Mobile devices often store data in reduced resolutions or custom formats in order to accommodate resource constraints and tailormade software. The Polyjuz framework enables sharin...
Kaushik Veeraraghavan, Venugopalan Ramasubramanian...
GLOBECOM
2009
IEEE
15 years 8 months ago
Data Acquisition through Joint Compressive Sensing and Principal Component Analysis
—In this paper we look at the problem of accurately reconstructing distributed signals through the collection of a small number of samples at a data gathering point. The techniqu...
Riccardo Masiero, Giorgio Quer, Daniele Munaretto,...
CONEXT
2009
ACM
15 years 2 months ago
Feasibility of content dissemination between devices in moving vehicles
We investigate the feasibility of content distribution between devices mounted in moving vehicles using commodity WiFi. We assume that each device stores content in a set of files...
Thomas Zahn, Greg O'Shea, Antony I. T. Rowstron
INFOCOM
2000
IEEE
15 years 6 months ago
Fair Bandwidth Sharing Among Virtual Networks: A Capacity Resizing Approach
Abstract—Virtual Private Networks (VPN) and link sharing are cost effective way of realizing corporate intranets. Corporate intranets will increasingly have to provide Integrated...
Rahul Garg, Huzur Saran