6105 search results - page 826 / 1221 » A Parallel Algorithm for Bound-Smoothing |
293
click to vote
ICCABS
2011
14 years 10 months ago
2011
—Research efforts to analyze biomolecular properties contribute towards our understanding of biomolecular function. Calculating non-bonded forces (or in our case, electrostatic s...
153
click to vote
APPROX
2005
Springer
16 years 10 days ago
2005
Springer
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
151
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers a...
202
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
196
click to vote
SIPS
2008
IEEE
16 years 1 months ago
2008
IEEE
Low-density parity-check (LDPC) codes on par with convolutional turbo codes (CTC) are two of the most powerful error correction codes known to perform very close to the Shannon li...