Sciweavers

5115 search results - page 316 / 1023
» On Randomized Lanczos Algorithms
Sort
View
ACL
2009
15 years 5 months ago
Learning with Annotation Noise
It is usually assumed that the kind of noise existing in annotated data is random classification noise. Yet there is evidence that differences between annotators are not always ra...
Eyal Beigman, Beata Beigman Klebanov
ICML
2009
IEEE
16 years 8 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
ICIAP
2005
ACM
16 years 7 months ago
Optimal Parameter Estimation for MRF Stereo Matching
Abstract. This paper presents an optimisation technique to select automatically a set of control parameters for a Markov Random Field applied to stereo matching. The method is base...
Riccardo Gherardi, Umberto Castellani, Andrea Fusi...
DCC
2004
IEEE
16 years 6 months ago
Multi-resolution Source Coding Using Entropy Constrained Dithered Scalar Quantization
In this paper, we build multi-resolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followe...
Qian Zhao, Hanying Feng, Michelle Effros
SAT
2005
Springer
124views Hardware» more  SAT 2005»
16 years 23 days ago
An Improved Upper Bound for SAT
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
Evgeny Dantsin, Alexander Wolpert