Sciweavers

4007 search results - page 159 / 802
» Computation with imprecise probabilities
Sort
View
141
Voted
PODC
2006
ACM
15 years 9 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
128
Voted
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
15 years 7 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
141
Voted
RC
2007
148views more  RC 2007»
15 years 3 months ago
Computing Population Variance and Entropy under Interval Uncertainty: Linear-Time Algorithms
In statistical analysis of measurement results, it is often necessary to compute the range [V , V ] of the population variance V = 1 n · n i=1 (xi −E)2 (where E = 1 n · n i=1 ...
Gang Xiang, Martine Ceberio, Vladik Kreinovich
125
Voted
PPSN
1994
Springer
15 years 7 months ago
RPL2: A Language and Parallel Framework for Evolutionary Computing
The Reproductive Plan Language 2 (RPL2) is an extensible interpreted language for writing and using evolutionary computing programs. It supports arbitrary genetic representations,...
Patrick D. Surry, Nicholas J. Radcliffe
ALMOB
2008
95views more  ALMOB 2008»
15 years 3 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen