Sciweavers

57 search results - page 6 / 12
» Practical Algorithms for Gathering Stored Correlated Data in...
Sort
View
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
14 years 8 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
WAE
2001
222views Algorithms» more  WAE 2001»
13 years 8 months ago
An Experimental Study of Data Migration Algorithms
The data migration problem is the problem of computing a plan for moving data objects stored on devices in a network from one configuration to another. Load balancing or changing u...
Eric J. Anderson, Joseph Hall, Jason D. Hartline, ...
EWSN
2004
Springer
14 years 27 days ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
TMC
2012
11 years 10 months ago
Message Drop and Scheduling in DTNs: Theory and Practice
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...
SPAA
1996
ACM
13 years 11 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick