Sciweavers

598 search results - page 34 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
SIAMJO
2011
12 years 11 months 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...
ICPR
2008
IEEE
14 years 10 months ago
A matrix alignment approach for link prediction
This paper introduces a new discriminative learning technique for link prediction based on the matrix alignment approach. Our algorithm automatically determines the most predictiv...
Jerry Scripps, Pang-Ning Tan, Feilong Chen, Abdol-...
PARA
1995
Springer
14 years 7 days ago
Decomposing Linear Programs for Parallel Solution
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
Ali Pinar, Ümit V. Çatalyürek, Ce...
FOCS
2009
IEEE
14 years 3 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
CDC
2010
IEEE
114views Control Systems» more  CDC 2010»
13 years 3 months ago
On subspace identification of cascade structured systems
Subspace identification has proven useful when identifying identifying multi-input multi-output systems. It is, however, important in many applications to take a priori structural ...
Per Hagg, Bo Wahlberg, Henrik Sandberg