Sciweavers

8 search results - page 1 / 2
» Optimal Boolean Matrix Decomposition: Application to Role En...
Sort
View
ICDE
2008
IEEE
129views Database» more  ICDE 2008»
15 years 11 months ago
Optimal Boolean Matrix Decomposition: Application to Role Engineering
Abstract-- A decomposition of a binary matrix into two matrices gives a set of basis vectors and their appropriate combination to form the original matrix. Such decomposition solut...
Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri
117
Voted
SIAMJO
2011
14 years 29 days ago
Rank-Sparsity Incoherence for Matrix Decomposition
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Pa...
GLVLSI
2009
IEEE
125views VLSI» more  GLVLSI 2009»
15 years 4 months ago
Timing-driven N-way decomposition
Logic decomposition has been extensively used to optimize the worst-case delay and the area in the technology independent phase. Bi-decomposition is one of the state-of-art techni...
David Bañeres, Jordi Cortadella, Michael Ki...
FPL
2006
Springer
85views Hardware» more  FPL 2006»
15 years 1 months ago
High-Performance and Parameterized Matrix Factorization on FPGAs
FPGAs have become an attractive choice for scientific computing. In this paper, we propose a high performance design for LU decomposition, a key kernel in many scientific and engi...
Ling Zhuo, Viktor K. Prasanna
SIAMJO
2011
14 years 5 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu