Sciweavers

2103 search results - page 76 / 421
» Approximate Learning of Dynamic Models
Sort
View
134
Voted
WWW
2009
ACM
16 years 3 months ago
Matchbox: large scale online bayesian recommendations
We present a probabilistic model for generating personalised recommendations of items to users of a web service. The Matchbox system makes use of content information in the form o...
David H. Stern, Ralf Herbrich, Thore Graepel
151
Voted
AVSS
2009
IEEE
15 years 6 months ago
Bayesian Bio-inspired Model for Learning Interactive Trajectories
—Automatic understanding of human behavior is an important and challenging objective in several surveillance applications. One of the main problems of this task consists in accur...
Alessio Dore, Carlo S. Regazzoni
130
Voted
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
15 years 9 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland
117
Voted
ECCV
2008
Springer
16 years 4 months ago
Learning for Optical Flow Using Stochastic Optimization
Abstract. We present a technique for learning the parameters of a continuousstate Markov random field (MRF) model of optical flow, by minimizing the training loss for a set of grou...
Yunpeng Li, Daniel P. Huttenlocher
334
Voted
ICA
2012
Springer
13 years 10 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...