132 search results - page 25 / 27 » Sparse Boolean Matrix Factorizations |
101
click to vote
COCO
2005
Springer
15 years 6 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
108
click to vote
RT
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents a technique, based on pre-computed light transport and separable BRDF approximation, for interactive rendering of non-diffuse objects under all-frequency envir...
111
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
123
click to vote
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...
143
click to vote
NIPS
2004
15 years 2 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...