Sciweavers

5901 search results - page 1074 / 1181
» Algorithms for Wireless Sensor Networks
Sort
View
MOBIQUITOUS
2007
IEEE
15 years 4 months ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt
SDM
2007
SIAM
109views Data Mining» more  SDM 2007»
14 years 11 months ago
Segmentations with Rearrangements
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
Aristides Gionis, Evimaria Terzi
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
15 years 3 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
SUTC
2008
IEEE
15 years 4 months ago
Hovering Information - Self-Organising Information that Finds Its Own Storage
A piece of Hovering Information is a geo-localized information residing in a highly dynamic environment such as a mobile ad hoc network. This information is attached to a geograph...
Alfredo A. Villalba Castro, Giovanna Di Marzo Seru...
INFOCOM
2011
IEEE
14 years 1 months ago
Optimizing network-coded cooperative communications via joint session grouping and relay node selection
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...
« Prev « First page 1074 / 1181 Last » Next »