Sciweavers

1329 search results - page 115 / 266
» Randomly Sampling Molecules
Sort
View
ECCC
2011
183views ECommerce» more  ECCC 2011»
13 years 5 months ago
Extractors and Lower Bounds for Locally Samplable Sources
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
Anindya De, Thomas Watson
ICML
2009
IEEE
14 years 11 months ago
Herding dynamical weights to learn
A new "herding" algorithm is proposed which directly converts observed moments into a sequence of pseudo-samples. The pseudosamples respect the moment constraints and ma...
Max Welling

Source Code
846views
14 years 5 months ago
Supervised Color Image Segmentation in a Markovian Framework
This is the sample implementation of a Markov random field based color image segmentation algorithm described in the following paper: Zoltan Kato, Ting Chuen Pong, and John Chu...
Mihaly Gara, Zoltan Kato
ESANN
2004
13 years 11 months ago
Robust overcomplete matrix recovery for sparse sources using a generalized Hough transform
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...
Fabian J. Theis, Pando G. Georgiev, Andrzej Cichoc...
AUTOMATICA
2002
93views more  AUTOMATICA 2002»
13 years 10 months ago
A probabilistic framework for problems with real structured uncertainty in systems and control
The objective of this paper is twofold. First, the problem of generation of real random matrix samples with uniform distribution in structured (spectral) norm bounded sets is stud...
Giuseppe Carlo Calafiore, Fabrizio Dabbene