Sciweavers

9260 search results - page 323 / 1852
» Posterior distributions are computable from predictive distr...
Sort
View
ICS
2010
Tsinghua U.
16 years 4 months ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
16 years 7 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
AINA
2010
IEEE
15 years 12 months ago
Consensus in Anonymous Distributed Systems: Is There a Weakest Failure Detector?
: This paper is on failure detectors to solve the consensus problem in asynchronous systems made up of anonymous processes prone to crash and connected by asynchronous reliable cha...
François Bonnet, Michel Raynal
GI
2008
Springer
15 years 7 months ago
A Novel Conceptual Model for Accessing Distributed Data and Applications, as well as Devices
: As data and services are increasingly distributed in the network, rather than stored in a fixed location, one can imagine a scenario in which the Personal Computer, intended as a...
Lucia Terrenghi, Thomas Lang
IPPS
2007
IEEE
16 years 1 months ago
Modeling of NAMD's Network Input/Output on Large PC Clusters
This study examined the interplay among processor speed, cluster interconnect and file I/O, using parallel applications to quantify interactions. We focused on a common case wher...
Nancy Tran, Daniel A. Reed