Sciweavers

824 search results - page 83 / 165
» Weighted Low-Rank Approximations
Sort
View
NC
1998
101views Neural Networks» more  NC 1998»
14 years 11 months ago
Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks
In this paper a new approach for approximation problems involving only few input and output parameters is presented and compared to traditional Backpropagation Neural Networks (BP...
Günther R. Raidl, Gabriele Kodydek
JAIR
2006
122views more  JAIR 2006»
14 years 9 months ago
Solving Factored MDPs with Hybrid State and Action Variables
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
Branislav Kveton, Milos Hauskrecht, Carlos Guestri...
SIAMCOMP
1998
124views more  SIAMCOMP 1998»
14 years 9 months ago
Near-Linear Time Construction of Sparse Neighborhood Covers
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, Davi...
ICCV
2009
IEEE
14 years 7 months ago
Bayesian Poisson regression for crowd counting
Poisson regression models the noisy output of a counting function as a Poisson random variable, with a log-mean parameter that is a linear function of the input vector. In this wo...
Antoni B. Chan, Nuno Vasconcelos
JMLR
2010
112views more  JMLR 2010»
14 years 4 months ago
Sparse Spectrum Gaussian Process Regression
We present a new sparse Gaussian Process (GP) model for regression. The key novel idea is to sparsify the spectral representation of the GP. This leads to a simple, practical algo...
Miguel Lázaro-Gredilla, Joaquin Quiñ...