Sciweavers

401 search results - page 47 / 81
» Group-theoretic Algorithms for Matrix Multiplication
Sort
View
SPAA
2006
ACM
14 years 4 months ago
The cache complexity of multithreaded cache oblivious algorithms
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
Matteo Frigo, Volker Strumpen
JACM
2000
119views more  JACM 2000»
13 years 10 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
CVPR
2007
IEEE
15 years 26 days ago
Nonnegative Tucker Decomposition
Nonnegative tensor factorization (NTF) is a recent multiway (multilinear) extension of nonnegative matrix factorization (NMF), where nonnegativity constraints are imposed on the C...
Yong-Deok Kim, Seungjin Choi
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
14 years 4 months ago
Rounding of Sequences and Matrices, with Applications
Abstract. We show that any real matrix can be rounded to an integer matrix in such a way that the rounding errors of all row sums are less than one, and the rounding errors of all ...
Benjamin Doerr, Tobias Friedrich, Christian Klein,...
SIAMIS
2008
119views more  SIAMIS 2008»
13 years 10 months ago
Direct Elastic Imaging of a Small Inclusion
In this paper we consider the problem of locating a small three-dimensional elastic inclusion, using arrays of elastic source transmitters and receivers. This procedure yields the ...
Habib Ammari, Pierre Calmon, Ekaterina Iakovleva