Sciweavers

914 search results - page 139 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
IPPS
2006
IEEE
14 years 2 months ago
Formal modeling and analysis of wireless sensor network algorithms in Real-Time Maude
Advanced wireless sensor network algorithms pose challenges to their formal modeling and analysis, such as modeling probabilistic and real-time behaviors and novel forms of commun...
Peter Csaba Ölveczky, Stian Thorvaldsen
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
14 years 2 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
FOCS
2003
IEEE
14 years 2 months ago
List-Decoding Using The XOR Lemma
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
Luca Trevisan
ICTAI
2003
IEEE
14 years 2 months ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
CVPR
2000
IEEE
14 years 1 months ago
Corner Guided Curve Matching and its Application to Scene Reconstruction
Corners and curves are important image features in many vision-based applications. Corners are usually more stable and easier to match than curves,while curves contain richer info...
Ying Shan, Zhengyou Zhang