Sciweavers

1068 search results - page 154 / 214
» Extremely randomized trees
Sort
View
TSP
2011
170views more  TSP 2011»
13 years 4 months ago
Model Selection for Sinusoids in Noise: Statistical Analysis and a New Penalty Term
—Detection of the number of sinusoids embedded in noise is a fundamental problem in statistical signal processing. Most parametric methods minimize the sum of a data fit (likeli...
Boaz Nadler, Leonid Kontorovich
AAAI
2011
12 years 10 months ago
An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
Byron Boots, Geoffrey J. Gordon
IACR
2011
132views more  IACR 2011»
12 years 9 months ago
Homomorphic encryption from codes
We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous latticeba...
Andrej Bogdanov, Chin Ho Lee
IACR
2011
92views more  IACR 2011»
12 years 9 months ago
From Non-Adaptive to Adaptive Pseudorandom Functions
Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to be indistinguishable from random in the eyes of a non-adaptive distinguisher (i....
Iftach Haitner, Itay Berman
JMLR
2012
12 years 13 days ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli