735 search results - page 6 / 147 » Randomization in Parallel Stringology |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Random binary matrices have found many applications in signal processing and coding. Rateless codes, for example, are based on the random generation of codewords by means of inner...
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
PODC
2012
ACM
11 years 9 months ago
2012
ACM
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
JMLR
2010
13 years 2 months ago
2010
Markov Random Fields (MRFs) are an important class of probabilistic models which are used for density estimation, classification, denoising, and for constructing Deep Belief Netwo...
SOFSEM
2012
Springer
12 years 2 months ago
2012
Springer
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...