109 search results - page 11 / 22 » Performance of CAP-Specified Linear Algebra Algorithms |
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Several methods have been proposed in the literature for the local enumeration of dense references for arrays distributed by the CYCLIC(k) data-distributionin High Performance For...
JSC
2007
14 years 9 months ago
2007
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
74
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...
86
Voted
CADE
2001
Springer
15 years 9 months ago
2001
Springer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...