Sciweavers

106 search results - page 17 / 22
» Average Case Analysis for Tree Labelling Schemes
Sort
View
DCOSS
2005
Springer
15 years 5 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
GLOBECOM
2008
IEEE
15 years 6 months ago
Routing with Probabilistic Delay Guarantees in Wireless Ad-Hoc Networks
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...
Matthew Brand, Petar Maymounkov, Andreas F. Molisc...
107
Voted
TSP
2010
14 years 6 months ago
Power allocation in orthogonal wireless relay networks with partial channel state information
Wireless amplify-and-forward relay networks in which the source communicates with the relays and destination in the first phase and the relays forward signals to the destination in...
Tung T. Pham, Ha H. Nguyen, Hoang Duong Tuan
DAC
2009
ACM
16 years 20 days ago
Enabling adaptability through elastic clocks
Power and performance benefits of scaling are lost to worst case margins as uncertainty of device characteristics is increasing. Adaptive techniques can dynamically adjust the mar...
Emre Tuncer, Jordi Cortadella, Luciano Lavagno
CVPR
2012
IEEE
13 years 2 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr