Sciweavers

1265 search results - page 56 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
DCOSS
2006
Springer
13 years 11 months ago
Comparative Analysis of Push-Pull Query Strategies for Wireless Sensor Networks
Abstract. We present a comparative mathematical analysis of two important distinct approaches to hybrid push-pull querying in wireless sensor networks: structured hash-based data-c...
Shyam Kapadia, Bhaskar Krishnamachari
DCOSS
2006
Springer
13 years 11 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
ICMLA
2007
13 years 9 months ago
Maximum Likelihood Quantization of Genomic Features Using Dynamic Programming
Dynamic programming is introduced to quantize a continuous random variable into a discrete random variable. Quantization is often useful before statistical analysis or reconstruct...
Mingzhou (Joe) Song, Robert M. Haralick, Sté...
MOBIHOC
2007
ACM
14 years 7 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
INFOCOM
2007
IEEE
14 years 2 months ago
Scalability of Routing Tables in Wireless Networks
— Consider a large wireless ad hoc network that facilitates communication between random pairs of network nodes. The paper investigates the size of routing tables as the number o...
Petar Momcilovic