Sciweavers

5153 search results - page 102 / 1031
» Introduction to Randomized Algorithms
Sort
View
117
Voted
CSR
2006
Springer
15 years 6 months ago
Constructive Equivalence Relations on Computable Probability Measures
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
Laurent Bienvenu
EMMCVPR
2001
Springer
15 years 6 months ago
Relaxing Symmetric Multiple Windows Stereo Using Markov Random Fields
This paper introduces R-SMW, a new algorithm for stereo
Andrea Fusiello, Umberto Castellani, Vittorio Muri...
CORR
2010
Springer
85views Education» more  CORR 2010»
15 years 2 months ago
Tensor sparsification via a bound on the spectral norm of random tensors
Given an order-d tensor A Rn
Nam H. Nguyen, Petros Drineas, Trac D. Tran
117
Voted
COCO
2003
Springer
93views Algorithms» more  COCO 2003»
15 years 7 months ago
The complexity of stochastic sequences
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
Wolfgang Merkle
COLT
2003
Springer
15 years 7 months ago
Learning Random Log-Depth Decision Trees under the Uniform Distribution
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
Jeffrey C. Jackson, Rocco A. Servedio