1310 search results - page 32 / 262 » Learning the k in k-means |
SODA
2012
ACM
13 years 5 days ago
2012
ACM
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
DICTA
2007
14 years 11 months ago
2007
A scheme, named tower of knowledge (ToK), is proposed for interpreting 3D scenes. The ToK encapsulates causal dependencies between object appearance and functionality. We demonstr...
NIPS
1997
14 years 11 months ago
1997
Singular value decomposition (SVD) can be viewed as a method for unsupervised training of a network that associates two classes of events reciprocally by linear connections throug...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...
COLT
1993
Springer
15 years 1 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...