Sciweavers

5153 search results - page 381 / 1031
» Introduction to Randomized Algorithms
Sort
View
NIPS
2003
15 years 6 months ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan
PICS
2000
15 years 6 months ago
Data Embedding Using Phase Dispersion
A method of data embedding based on the convolution of message data with a random phase carrier is presented. The theory behind this method is reviewed and it is shown that the te...
Chris Honsinger
AAAI
1994
15 years 6 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter
AUTOMATICA
2002
93views more  AUTOMATICA 2002»
15 years 4 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
RSA
1998
53views more  RSA 1998»
15 years 4 months ago
Recursive reconstruction on periodic trees
A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjace...
Elchanan Mossel