Sciweavers

Share
18 search results - page 1 / 4
» Average-case complexity of the min-sum matrix product proble...
Sort
View
JC
2011
102views more  JC 2011»
8 years 8 months ago
Tractability of tensor product problems in the average case setting
It has been an open problem to derive a necessary and suļ¬ƒcient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...
Anargyros Papageorgiou, Iasonas Petras
TCS
2016
3 years 9 months ago
Average-case complexity of the min-sum matrix product problem
rder Abstract Voronoi Diagrams. Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou and Maksym Zavershynskyi 3D rectangulations and geometric matrix multiplication. Peter Floderus...
Ken C. K. Fong, Minming Li, Hongyu Liang, Linji Ya...
PKDD
2015
Springer
17views Data Mining» more  PKDD 2015»
3 years 9 months ago
Generalized Matrix Factorizations as a Unifying Framework for Pattern Set Mining: Complexity Beyond Blocks
Matrix factorizations are a popular tool to mine regularities from data. There are many ways to interpret the factorizations, but one particularly suited for data mining utilizes t...
Pauli Miettinen
ISCAS
2006
IEEE
112views Hardware» more  ISCAS 2006»
9 years 7 months ago
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
DISOPT
2011
201views Education» more  DISOPT 2011»
8 years 5 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
books