1276 search results - page 247 / 256 » Clustering Algorithms Optimizer: A Framework for Large Datas... |
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
SIGMETRICS
2004
ACM
14 years 16 days ago
2004
ACM
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefet...
ICCV
2003
IEEE
14 years 12 days ago
2003
IEEE
Active object tracking, for example, in surveillance tasks, becomes more and more important these days. Besides the tracking algorithms themselves methodologies have to be develop...
ECAI
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
ICIP
2003
IEEE
14 years 8 months ago
2003
IEEE
We present algorithms for automatic feature selection for unsupervised structure discovery from video sequences. Feature selection in this scenario is hard because of the absence ...