Sciweavers

1414 search results - page 45 / 283
» Randomness and Universal Machines
Sort
View
TIT
1998
90views more  TIT 1998»
13 years 8 months ago
Source Codes as Random Number Generators
—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asy...
Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio ...
COLT
2010
Springer
13 years 6 months ago
Sparse Recovery in Convex Hulls of Infinite Dictionaries
Let S be an arbitrary measurable space, T R and (X, Y ) be a random couple in S
Vladimir Koltchinskii, Stas Minsker
ICML
2010
IEEE
13 years 9 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
ITC
1997
IEEE
129views Hardware» more  ITC 1997»
14 years 26 days ago
On Using Machine Learning for Logic BIST
This paper presents a new approach for designing test sequences to be generated on–chip. The proposed technique is based on machine learning, and provides a way to generate effi...
Christophe Fagot, Patrick Girard, Christian Landra...
ICASSP
2011
IEEE
13 years 11 days ago
Factor graph switching portfolios under transaction costs
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...
Andrew J. Bean, Andrew C. Singer