1434 search results - page 133 / 287 » Distributed Computing with Imperfect Randomness |
125
click to vote
SIGGRAPH
1996
ACM
15 years 6 months ago
1996
ACM
Antialiased pixel values are often computed as the mean of N point samples. Using uniformly distributed random samples, the central limit theorem predicts a variance of the mean o...
127
click to vote
LCN
2000
IEEE
15 years 5 months ago
2000
IEEE
Future computer networks are expected to carry bursty real-time traffic with stringent time-delay requirements. Popular shortest-path routing protocols have the disadvantage of ca...
130
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
135
click to vote
EUROPAR
2009
Springer
15 years 5 months ago
2009
Springer
Whereas traditional Desktop Grids rely on centralized servers for data management, some recent progress has been made to enable distributed, large input data, using to peer-to-peer...
109
click to vote
TMI
2002
15 years 1 months ago
2002
We describe a method for computing a continuous time estimate of tracer density using list-mode positron emission tomography data. The rate function in each voxel is modeled as an ...