Sciweavers

1806 search results - page 111 / 362
» Randomness and halting probabilities
Sort
View
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...
CIE
2009
Springer
14 years 3 months ago
Computable Exchangeable Sequences Have Computable de Finetti Measures
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
Cameron E. Freer, Daniel M. Roy
ICPR
2010
IEEE
14 years 2 months ago
Using Sequential Context for Image Analysis
—This paper proposes the sequential context inference (SCI) algorithm for Markov random field (MRF) image analysis. This algorithm is designed primarily for fast inference on an...
Antonio Paiva, Elizabeth Jurrus, Tolga Tasdizen
CRYPTO
2005
Springer
94views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Improved Security Analyses for CBC MACs
We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bit...
Mihir Bellare, Krzysztof Pietrzak, Phillip Rogaway
SAT
2005
Springer
162views Hardware» more  SAT 2005»
14 years 2 months ago
Heuristics for Fast Exact Model Counting
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
Tian Sang, Paul Beame, Henry A. Kautz