Sciweavers

241 search results - page 21 / 49
» On Generating Independent Random Strings
Sort
View
ICML
2010
IEEE
13 years 8 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
ICICS
2009
Springer
14 years 2 months ago
Biometric-Based Non-transferable Anonymous Credentials
This work explores the problem of using biometric data to achieve non-transferability of anonymous credentials; that is, sharing of anonymous credentials, which allow one to anonym...
Marina Blanton, William M. P. Hudelson
WIA
2007
Springer
14 years 1 months ago
Average Value and Variance of Pattern Statistics in Rational Models
We study the pattern statistics representing the number of occurrences of a given string in a word of length n generated at random by rational stochastic models, defined by means ...
Massimiliano Goldwurm, Roberto Radicioni
COLT
1998
Springer
13 years 11 months ago
Learning One-Variable Pattern Languages in Linear Average Time
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
Rüdiger Reischuk, Thomas Zeugmann
JMLR
2010
158views more  JMLR 2010»
13 years 2 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe