Amanote Research
Register
Sign In
Walk 'N' Merge: A Scalable Algorithm for Boolean Tensor Factorization
doi 10.1109/icdm.2013.141
Full Text
Open PDF
Abstract
Available in
full text
Date
December 1, 2013
Authors
Dora Erdos
Pauli Miettinen
Publisher
IEEE
Related search
TuckER: Tensor Factorization for Knowledge Graph Completion
FastStep: Scalable Boolean Matrix Decomposition
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Matrix and Tensor Factorization for Predicting Student Performance
Knowledge Completion for Generics Using Guided Tensor Factorization
Transactions of the Association for Computational Linguistics
A Scalable Algorithm for Packet Classification
Mobility Mining Using Nonnegative Tensor Factorization
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Highly-Scalable Searchable Symmetric Encryption With Support for Boolean Queries
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
SIAM Journal of Scientific Computing
Computational Mathematics
Applied Mathematics
A Scalable Algorithm for Learning a Mahalanobis Distance Metric
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
