2924 search results - page 160 / 585 » Lower Bounds in Distributed Computing |
111
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
122
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
178
Voted
SIGMOD
2008
ACM
16 years 29 days ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
105
Voted
ESA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received a greater deal of attention in...
127
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...