Sciweavers

244 search results - page 36 / 49
» On-Line Probability, Complexity and Randomness
Sort
View
FC
2006
Springer
145views Cryptology» more  FC 2006»
14 years 15 days ago
Efficient Correlated Action Selection
Abstract. Participants in e-commerce and other forms of online collaborations tend to be selfish and rational, and therefore game theory has been recognized as particularly relevan...
Mikhail J. Atallah, Marina Blanton, Keith B. Frikk...
LICS
2002
IEEE
14 years 1 months ago
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
Sophie Laplante, Richard Lassaigne, Fréd&ea...
TIT
2010
128views Education» more  TIT 2010»
13 years 3 months ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh
PODC
2006
ACM
14 years 2 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 3 months ago
A QoS Architecture for IDMA-Based Multi-Service Wireless Networks
— The recent investigations on interleave-division multiple-access (IDMA) have demonstrated its advantage in supporting high-data-rate and multi-rate services over wireless fadin...
Qian Huang, Sammy Chan, King-Tim Ko, Li Ping, Peng...