Sciweavers

280 search results - page 25 / 56
» Binary Matrix Factorization with Applications
Sort
View
SIAMMAX
2010
164views more  SIAMMAX 2010»
15 years 18 days ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
ICASSP
2010
IEEE
15 years 3 months ago
A sparse component model of source signals and its application to blind source separation
In this paper, we propose a new method of blind source separation (BSS) for music signals. Our method has the following characteristics: 1) the method is a combination of the spar...
Yu Kitano, Hirokazu Kameoka, Yosuke Izumi, Nobutak...
ISQED
2008
IEEE
153views Hardware» more  ISQED 2008»
16 years 8 days ago
Accelerating Clock Mesh Simulation Using Matrix-Level Macromodels and Dynamic Time Step Rounding
Clock meshes have found increasingly wide applications in today’s high-performance IC designs. The inherent routing redundancies associated with clock meshes lead to improved cl...
Xiaoji Ye, Min Zhao, Rajendran Panda, Peng Li, Jia...
ICA
2010
Springer
15 years 7 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...
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
14 years 8 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman