230 search results - page 38 / 46 » Sparse matrix factorization on massively parallel computers |
DCOSS
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
ICRA
1999
IEEE
15 years 1 months ago
1999
IEEE
Techniques for interactive 3D manipulation of articulated objects in cluttered environments should be geometricallyaware, going beyond basic inverse or forward kinematics to allow...
106
click to vote
FPL
2008
Springer
14 years 11 months ago
2008
Springer
Cryptanalysis of symmetric and asymmetric ciphers is a challenging task due to the enormous amount of involved computations. To tackle this computational complexity, usually the e...
121
click to vote
MST
2010
14 years 4 months ago
2010
We consider triply-nested loops of the type that occur in the standard Gaussian elimination algorithm, which we denote by GEP (or the Gaussian Elimination Paradigm). We present tw...
97
Voted
JMLR
2010
14 years 4 months ago
2010
We show how a preselection of hidden variables can be used to efficiently train generative models with binary hidden variables. The approach is based on Expectation Maximization (...