Sciweavers

1192 search results - page 131 / 239
» Computing Weakest Readings
Sort
View
160
Voted
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 7 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
124
Voted
PODC
2010
ACM
15 years 7 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
153
Voted
NSDI
2008
15 years 6 months ago
UsenetDHT: A Low-Overhead Design for Usenet
Usenet is a popular distributed messaging and file sharing service: servers in Usenet flood articles over an overlay network to fully replicate articles across all servers. Howeve...
Emil Sit, Robert Morris, M. Frans Kaashoek
127
Voted
NSDI
2004
15 years 5 months ago
Consistent and Automatic Replica Regeneration
Reducing management costs and improving the availability of large-scale distributed systems require automatic replica regeneration, i.e., creating new replicas in response to repl...
Haifeng Yu, Amin Vahdat
135
Voted
BMCBI
2010
148views more  BMCBI 2010»
15 years 3 months ago
Calling SNPs without a reference sequence
Background: The most common application for the next-generation sequencing technologies is resequencing, where short reads from the genome of an individual are aligned to a refere...
Aakrosh Ratan, Yu Zhang, Vanessa M. Hayes, Stephan...