6105 search results - page 325 / 1221 » A Parallel Algorithm for Bound-Smoothing |
171
Voted
PPOPP
2010
ACM
16 years 4 months ago
2010
ACM
In LAPACK many matrix operations are cast as block algorithms which iteratively process a panel using an unblocked algorithm and then update a remainder matrix using the high perf...
157
click to vote
ISPDC
2005
IEEE
16 years 9 days ago
2005
IEEE
: Optimization is a healthy field targeted to find efficient solutions and algorithms to solve problems either in the academia and the industry. As the solved problems became harde...
164
click to vote
AAIM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This paper presents PLDA, our parallel implementation of Latent Dirichlet Allocation on MPI and MapReduce. PLDA smooths out storage and computation bottlenecks and provid...
155
click to vote
WSCG
2004
15 years 8 months ago
2004
We describe a novel load-balancing method for sort-first parallel graphics rendering systems. It gives up geometry data which could be very large and tends to cause unacceptable c...
161
click to vote
PPSC
1993
15 years 8 months ago
1993
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...