385 search results - page 4 / 77 » A Fast Algorithm for Matrix Balancing |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
ACL
1997
13 years 9 months ago
1997
Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...
SODA
1996
ACM
13 years 9 months ago
1996
ACM