Sciweavers

244 search results - page 10 / 49
» On-Line Probability, Complexity and Randomness
Sort
View
MFCS
2005
Springer
14 years 2 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
ISIPTA
2003
IEEE
140views Mathematics» more  ISIPTA 2003»
14 years 2 months ago
A Second-Order Uncertainty Model of Independent Random Variables: An Example of the Stress-Strength Reliability
A second-order hierarchical uncertainty model of a system of independent random variables is studied in the paper. It is shown that the complex nonlinear optimization problem for ...
Lev V. Utkin
NIPS
2004
13 years 10 months ago
Comparing Beliefs, Surveys, and Random Walks
Survey propagation is a powerful technique from statistical physics that has been applied to solve the 3-SAT problem both in principle and in practice. We give, using only probabi...
Erik Aurell, Uri Gordon, Scott Kirkpatrick
LOGCOM
2007
89views more  LOGCOM 2007»
13 years 8 months ago
Algorithmic Randomness of Closed Sets
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
George Barmpalias, Paul Brodhead, Douglas Cenzer, ...
ICASSP
2009
IEEE
14 years 3 months ago
On ICA of improper and noncircular sources
We provide a review of independent component analysis (ICA) for complex-valued improper and noncircular random sources. An improper random signal is correlated with its complex co...
Peter J. Schreier, Tülay Adali, Louis L. Scha...