132 search results - page 23 / 27 » Sparse Boolean Matrix Factorizations |
RECSYS
2010
ACM
13 years 7 months ago
2010
ACM
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper, we derive concentration of measure inequalities for compressive Toeplitz matrices (having fewer rows than columns) with entries drawn from an independent and identic...
ICRA
1999
IEEE
13 years 11 months ago
1999
IEEE
Techniques for interactive 3D manipulation of articulated objects in cluttered environments should be geometricallyaware, going beyond basic inverse or forward kinematics to allow...
STOC
2009
ACM
14 years 7 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations. CG (the conjugate-gradient method) is reliable on positive-def...