Sciweavers

132 search results - page 21 / 27
» Sparse Boolean Matrix Factorizations
Sort
View
JMLR
2008
188views more  JMLR 2008»
14 years 9 months ago
Maximal Causes for Non-linear Component Extraction
We study a generative model in which hidden causes combine competitively to produce observations. Multiple active causes combine to determine the value of an observed variable thr...
Jörg Lücke, Maneesh Sahani
CORR
2012
Springer
225views Education» more  CORR 2012»
13 years 5 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
COMPUTING
2007
103views more  COMPUTING 2007»
14 years 9 months ago
An algebraic approach for H-matrix preconditioners
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
S. Oliveira, F. Yang
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
15 years 3 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan
IMC
2007
ACM
14 years 11 months ago
Blind source separation approach to performance diagnosis and dependency discovery
We consider the problem of diagnosing performance problems in distributed system and networks given end-to-end performance measurements provided by test transactions, or probes. C...
Gaurav Chandalia, Irina Rish