Walk’n’Merge: A Scalable Algorithm for Boolean Tensor Factorization D´ora Erd˝os Pauli Miettinen

First Page		Document Content
Date: 2013-12-06 18:36:48 Multilinear algebra Tensors Multivariate statistics Matrix theory Linear algebra Higher-order singular value decomposition Outer product Matrix decomposition Rank Mathematics of general relativity		Walk’n’Merge: A Scalable Algorithm for Boolean Tensor Factorization D´ora Erd˝os Pauli Miettinen Add to Reading List Source URL: people.mpi-inf.mpg.de Download Document from Source Website File Size: 294,39 KB Share Document on Facebook

	Reducing Dimensions of Tensors in Type-Driven Distributional Semantics Tamara Polajnar Luana Fˇagˇarˇas¸an Stephen Clark Computer Laboratory University of Cambridge Cambridge, UK DocID: 1uwQl - View Document
	Class.Q.Grav. VolppMay-1987 THE RIEMANN AND EXTRINSIC CURVATURE TENSORS IN THE REGGE CALCULUS DocID: 1utF3 - View Document
	High-Order Low-Rank Tensors for Semantic Role Labeling Tao Lei1 , Yuan Zhang1 , Llu´ıs M`arquez2 , Alessandro Moschitti2 , and Regina Barzilay1 1 Computer Science and Artificial Intelligence Laboratory, Massachusetts I DocID: 1u7Iz - View Document
	Mining Interesting Local Structure from Tensors Abhinav Maurya Information Systems Carnegie Mellon University DocID: 1tYmm - View Document
	NASA/TM—An Introduction to Tensors for Students of Physics and Engineering Joseph C. Kolecki Glenn Research Center, Cleveland, Ohio DocID: 1tXKY - View Document