Sciweavers

322 search results - page 49 / 65
» Algorithms for Large Integer Matrix Problems
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
WAIM
2009
Springer
14 years 5 days ago
Kernel-Based Transductive Learning with Nearest Neighbors
In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this ...
Liangcai Shu, Jinhui Wu, Lei Yu, Weiyi Meng
MEDIAFORENSICS
2010
13 years 9 months ago
Minimizing embedding impact in steganography using trellis-coded quantization
In this paper, we propose a practical approach to minimizing embedding impact in steganography based on syndrome coding and trellis-coded quantization and contrast its performance...
Tomás Filler, Jan Judas, Jessica J. Fridric...
KDD
2012
ACM
254views Data Mining» more  KDD 2012»
11 years 10 months ago
Playlist prediction via metric embedding
Digital storage of personal music collections and cloud-based music services (e.g. Pandora, Spotify) have fundamentally changed how music is consumed. In particular, automatically...
Shuo Chen, Josh L. Moore, Douglas Turnbull, Thorst...
NIPS
2004
13 years 9 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson