Sciweavers

23 search results - page 2 / 5
» Optimal Factorization of Three-Way Binary Data
Sort
View
ICA
2010
Springer
13 years 6 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...
ICDM
2010
IEEE
146views Data Mining» more  ICDM 2010»
13 years 2 months ago
One-Class Matrix Completion with Low-Density Factorizations
Consider a typical recommendation problem. A company has historical records of products sold to a large customer base. These records may be compactly represented as a sparse custom...
Vikas Sindhwani, Serhat Selcuk Bucak, Jianying Hu,...
CORR
2011
Springer
193views Education» more  CORR 2011»
12 years 8 months ago
Gigapixel Binary Sensing: Image Acquisition Using Oversampled One-Bit Poisson Statistics
We study a new gigapixel image sensor that is reminiscent of traditional photographic film. Each pixel in the sensor has a binary response, giving only a one-bit quantized measur...
Feng Yang, Yue M. Lu, Luciano Sbaiz, Martin Vetter...
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
14 years 5 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 7 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu