Sciweavers

3875 search results - page 534 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Regularization and feature selection in least-squares temporal difference learning
We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (L...
J. Zico Kolter, Andrew Y. Ng
EDBT
2004
ACM
142views Database» more  EDBT 2004»
16 years 6 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
ICASSP
2009
IEEE
16 years 1 months ago
Maximizing global entropy reduction for active learning in speech recognition
We propose a new active learning algorithm to address the problem of selecting a limited subset of utterances for transcribing from a large amount of unlabeled utterances so that ...
Balakrishnan Varadarajan, Dong Yu, Li Deng, Alex A...
ICTAI
2007
IEEE
16 years 28 days ago
Photometric Invariant Projective Registration Using ECC Maximization
The ability of an algorithm to accurately estimate the parameters of the geometric transformation which aligns two image profiles even in the presence of photometric distortions ...
Georgios D. Evangelidis, Emmanouil Z. Psarakis
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
15 years 10 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani