9 search results - page 2 / 2 » Relative-Error CUR Matrix Decompositions |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Compression schemes for EEG signals are developed based on matrix and tensor decomposition. Various ways to arrange EEG signals into matrices and tensors are explored, and several...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
TCS
2011
13 years 2 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...