Sciweavers

282 search results - page 14 / 57
» Additive Preconditioning for Matrix Computations
Sort
View
ESA
2008
Springer
106views Algorithms» more  ESA 2008»
15 years 2 months ago
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
Seung-Jin Sul, Tiffani L. Williams
88
Voted
ISCA
2007
IEEE
114views Hardware» more  ISCA 2007»
15 years 6 months ago
Matrix scheduler reloaded
From multiprocessor scale-up to cache sizes to the number of reorder-buffer entries, microarchitects wish to reap the benefits of more computing resources while staying within po...
Peter G. Sassone, Jeff Rupley, Edward Brekelbaum, ...
108
Voted
CORR
2010
Springer
175views Education» more  CORR 2010»
15 years 17 days ago
Incorporating Side Information in Probabilistic Matrix Factorization with Gaussian Processes
Probabilistic matrix factorization (PMF) is a powerful method for modeling data associated with pairwise relationships, finding use in collaborative filtering, computational biolo...
Ryan Prescott Adams, George E. Dahl, Iain Murray
117
Voted
SMC
2010
IEEE
202views Control Systems» more  SMC 2010»
14 years 11 months ago
Evaluating the performance of nonnegative matrix factorization for constructing semantic spaces: Comparison to latent semantic a
—This study examines the ability of nonnegative matrix factorization (NMF) as a method for constructing semantic spaces, in which the meaning of each word is represented by a hig...
Akira Utsumi
ASAP
2008
IEEE
118views Hardware» more  ASAP 2008»
15 years 7 months ago
Bit matrix multiplication in commodity processors
Registers in processors generally contain words or, with the addition of multimedia extensions, short vectors of subwords of bytes or 16-bit elements. In this paper, we view the c...
Yedidya Hilewitz, Cédric Lauradoux, Ruby B....