81 search results - page 2 / 17 » A Fast Random Sampling Algorithm for Sparsifying Matrices |
INFORMATICALT
1998
13 years 5 months ago
1998
Abstract. We study invertibility of big n × n matrices. There exists a number of algorithms, especially in mathematical statistics and numerical mathematics, requiring to invert s...
PCI
2001
Springer
13 years 10 months ago
2001
Springer
We demonstrate that an algorithm proposed by Drineas et. al. in [7] to approximate the singular vectors/values of a matrix A, is not only of theoretical interest but also a fast, v...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
JC
2007
13 years 5 months ago
2007
Compressed sensing is a new area of signal processing. Its goal is to minimize the number of samples that need to be taken from a signal for faithful reconstruction. The performan...
VTS
2005
IEEE
13 years 11 months ago
2005
IEEE
This paper describes a random jitter measurement technique using simple algorithms and comparator sampling. The approach facilitates using Automated Test Equipment (ATE) to valida...