Sciweavers

389 search results - page 40 / 78
» Computational Alternatives to Random Number Generators
Sort
View
JCO
2008
84views more  JCO 2008»
14 years 9 months ago
Partitioning a weighted partial order
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
Linda S. Moonen, Frits C. R. Spieksma
TPDS
2002
136views more  TPDS 2002»
14 years 9 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
GI
2009
Springer
15 years 2 months ago
Tapir: Language Support to Reduce the State Space in Model-Checking
: Model-checking is a way of testing the correctness of concurrent programs. To do so, a model of the program is proven to match properties and constraints specified by the progra...
Ronald Veldema, Michael Philippsen
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
15 years 10 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
ICML
2010
IEEE
14 years 10 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
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 ...
Philip M. Long, Rocco A. Servedio