3894 search results - page 508 / 779 » Approximation Algorithms for Biclustering Problems |
166
click to vote
SPIRE
2010
Springer
15 years 2 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
143
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (L...
134
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
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...
164
Voted
ICASSP
2009
IEEE
15 years 11 months ago
2009
IEEE
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 ...
115
click to vote
ICTAI
2007
IEEE
15 years 10 months ago
2007
IEEE
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 ...