590 search results - page 75 / 118 » Resolution-stationary random number generators |
125
click to vote
AAAI
2004
15 years 5 months ago
2004
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
118
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
150
click to vote
ICML
2010
IEEE
15 years 5 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 ...
119
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
—The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown group of sensors have been reprogrammed by a m...
140
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
We present a new machine learning framework called "self-taught learning" for using unlabeled data in supervised classification tasks. We do not assume that the unlabele...