Sciweavers

4973 search results - page 710 / 995
» Probabilistic Algorithms in Robotics
Sort
View
ADHOC
2007
121views more  ADHOC 2007»
15 years 6 months ago
Power-aware single- and multipath geographic routing in sensor networks
Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a signiï¬...
Shibo Wu, K. Selçuk Candan
ADHOC
2007
144views more  ADHOC 2007»
15 years 6 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac
ALMOB
2008
95views more  ALMOB 2008»
15 years 6 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
TMI
2010
217views more  TMI 2010»
15 years 1 months ago
A Generative Model for Image Segmentation Based on Label Fusion
We propose a nonparametric, probabilistic model for the automatic segmentation of medical images, given a training set of images and corresponding label maps. The resulting inferen...
Mert R. Sabuncu, B. T. Thomas Yeo, Koenraad Van Le...
ASIACRYPT
2011
Springer
14 years 6 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer