401 search results - page 31 / 81 » Group-theoretic Algorithms for Matrix Multiplication |
79
Voted
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
Nonnegative Tucker decomposition (NTD) is a recent multiway extension of nonnegative matrix factorization (NMF), where nonnegativity constraints are incorporated into Tucker model...
77
Voted
ICML
2007
IEEE
16 years 17 days ago
2007
IEEE
An efficient and general multiple kernel learning (MKL) algorithm has been recently proposed by Sonnenburg et al. (2006). This approach has opened new perspectives since it makes ...
108
click to vote
ICCV
2011
IEEE
13 years 11 months ago
2011
IEEE
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
COCO
2008
Springer
15 years 1 months ago
2008
Springer
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
135
click to vote
ICCS
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. The efficient use of multicore architectures for sparse matrixvector multiplication (SpMV) is currently an open challenge. One algorithm which makes use of SpMV is the ma...