143 search results - page 4 / 29 » Quick Approximation to Matrices and Applications |
CORR
2011
Springer
12 years 10 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
IPL
2011
13 years 1 months ago
2011
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Consider a rational matrix, particularly one whose entries have large numerators and denominators, but which is presented as a product of very sparse matrices with relatively smal...
19
Voted
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
NIPS
2004
13 years 8 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...