Sciweavers

8669 search results - page 139 / 1734
» Computing matrix representations
Sort
View
ESA
2008
Springer
106views Algorithms» more  ESA 2008»
15 years 8 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
SIAMSC
2008
167views more  SIAMSC 2008»
15 years 6 months ago
Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...
Moody T. Chu, Matthew M. Lin
SAINT
2008
IEEE
16 years 24 days ago
Matrix Routing -- An Interference Range Insensitive Routing Protocol for Wireless Sensor Networks
Interference ranges can dramatically affect the throughput in wireless sensor networks. While the transmission range defines the maximum physical range of a radio signal the inter...
Monty Beuster, Michael Beigl, Daniel Röhr, Ti...
ISCA
2007
IEEE
114views Hardware» more  ISCA 2007»
16 years 22 days 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, ...
CSL
2005
Springer
15 years 12 months ago
Feasible Proofs of Matrix Properties with Csanky's Algorithm
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Michael Soltys