Sciweavers

1414 search results - page 91 / 283
» Randomness and Universal Machines
Sort
View
JMLR
2006
135views more  JMLR 2006»
13 years 10 months ago
Quantile Regression Forests
Random forests were introduced as a machine learning tool in Breiman (2001) and have since proven to be very popular and powerful for high-dimensional regression and classificatio...
Nicolai Meinshausen
TCC
2010
Springer
133views Cryptology» more  TCC 2010»
13 years 7 months ago
On the Necessary and Sufficient Assumptions for UC Computation
Abstract. We study the necessary and sufficient assumptions for universally composable (UC) computation, both in terms of setup and computational assumptions. We look at the common...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...
ACL
2006
13 years 11 months ago
Modelling Lexical Redundancy for Machine Translation
Certain distinctions made in the lexicon of one language may be redundant when translating into another language. We quantify redundancy among source types by the similarity of th...
David Talbot, Miles Osborne
ICML
2009
IEEE
14 years 10 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
ICMCS
2006
IEEE
133views Multimedia» more  ICMCS 2006»
14 years 4 months ago
A Captcha Based on the Human Visual Systems Masking Characteristics
In this paper, a CAPTCHA is presented based on the masking characteristics of the Human Visual System (HVS). Knowing that noise can be masked by high activity regions and showing ...
Rony Ferzli, Rida A. Bazzi, Lina J. Karam