1612 search results - page 246 / 323 » Analysing Randomized Distributed Algorithms |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
SPAA
1997
ACM
15 years 2 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
MOBIHOC
2003
ACM
15 years 9 months ago
2003
ACM
The development of lightweight sensing and communication protocols is a key requirement for designing resource constrained sensor networks. This paper introduces a set of efficien...
159
Voted
SIGMOD
2008
ACM
15 years 10 months 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...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...