81 search results - page 5 / 17 » A Fast Random Sampling Algorithm for Sparsifying Matrices |
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
PVLDB
2008
13 years 7 months ago
2008
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...