735 search results - page 46 / 147 » Randomization in Parallel Stringology |
129
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
132
click to vote
SPAA
2009
ACM
15 years 11 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
124
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
109
Voted
HIPC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...
150
Voted
RECOMB
2005
Springer
16 years 2 months ago
2005
Springer
Abstract. Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e. segmenta...