Sciweavers

2512 search results - page 136 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
ICIP
2005
IEEE
15 years 11 months ago
Visual tracking via efficient kernel discriminant subspace learning
Robustly tracking moving objects in video sequences is one of the key problems in computer vision. In this paper we introduce a computationally efficient nonlinear kernel learning...
Chunhua Shen, Anton van den Hengel, Michael J. Bro...
ACML
2009
Springer
15 years 2 months ago
Learning Algorithms for Domain Adaptation
A fundamental assumption for any machine learning task is to have training and test data instances drawn from the same distribution while having a sufficiently large number of tra...
Manas A. Pathak, Eric Nyberg
AAAI
2008
15 years 12 days ago
Economic Hierarchical Q-Learning
Hierarchical state decompositions address the curse-ofdimensionality in Q-learning methods for reinforcement learning (RL) but can suffer from suboptimality. In addressing this, w...
Erik G. Schultink, Ruggiero Cavallo, David C. Park...
PAMI
2011
14 years 5 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
CICLING
2010
Springer
15 years 4 months ago
Computational Models of Language Acquisition
Abstract. Child language acquisition, one of Nature’s most fascinating phenomena, is to a large extent still a puzzle. Experimental evidence seems to support the view that early ...
Shuly Wintner