Sciweavers

625 search results - page 20 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
EWSN
2006
Springer
15 years 9 months ago
PAQ: Time Series Forecasting for Approximate Query Answering in Sensor Networks
In this paper, we present a method for approximating the values of sensors in a wireless sensor network based on time series forecasting. More specifically, our approach relies on ...
Daniela Tulone, Samuel Madden
JSAC
2010
99views more  JSAC 2010»
14 years 8 months ago
Robust wireless video streaming using hybrid spatial/temporal retransmission
—Bandwidth demands and timing constraints are two major challenges for wireless video streaming applications. In this paper, we present a hybrid spatial/temporal retransmission p...
Mei-Hsuan Lu, Peter Steenkiste, Tsuhan Chen
SIGMETRICS
2010
ACM
193views Hardware» more  SIGMETRICS 2010»
14 years 9 months ago
Distributed caching over heterogeneous mobile networks
Sharing content over a mobile network through opportunistic contacts has recently received considerable attention. In proposed scenarios, users store content they download in a lo...
Stratis Ioannidis, Laurent Massoulié, Augus...
HPCC
2009
Springer
15 years 2 months ago
Grid Network Dimensioning by Modeling the Deadline Constrained Bulk Data Transfers
—Grid applications need to move large amounts of data between distributed resources within deterministic time frames. In most cases it is possible to specify the volume and the d...
Kashif Munir, Pascale Vicat-Blanc Primet, Michael ...
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
14 years 9 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller