1351 search results - page 98 / 271 » Learning from compressed observations |
103
click to vote
CVPR
2003
IEEE
16 years 2 days ago
2003
IEEE
This paper addresses the problem of capturing the dynamics for exemplar-based recognition systems. Traditional HMM provides a probabilistic tool to capture system dynamics and in ...
124
click to vote
AAAI
2010
14 years 11 months ago
2010
Data sparsity is a major problem for collaborative filtering (CF) techniques in recommender systems, especially for new users and items. We observe that, while our target data are...
106
click to vote
AROBOTS
2011
14 years 5 months ago
2011
Abstract— GP-BayesFilters are a general framework for integrating Gaussian process prediction and observation models into Bayesian filtering techniques, including particle filt...
ICIP
2002
IEEE
15 years 3 months ago
2002
IEEE
Context-based adaptive entropy coding is an essential feature of modern image compression algorithms; however, the design of these coders is non-trivial due to the balance that mu...
PAKDD
2000
ACM
15 years 1 months ago
2000
ACM
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...