Amanote Research

Amanote Research

    RegisterSign In

FastStep: Scalable Boolean Matrix Decomposition

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-31753-3_37
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2016

Authors
Miguel AraujoPedro RibeiroChristos Faloutsos
Publisher

Springer International Publishing


Related search

Dynamic Boolean Matrix Factorizations

2012English

Scalable Decomposition of Speech Waveforms

English

Boolean Powers: Direct Decomposition and Isomorphism Types

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1981English

Boolean Factoring and Decomposition of Logic Networks

2008English

A Note on Boolean Matrix Theory

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1952English

Highly-Scalable Searchable Symmetric Encryption With Support for Boolean Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Scalable TFETI Domain Decomposition Based Contact Algorithm

2011English

Walk 'N' Merge: A Scalable Algorithm for Boolean Tensor Factorization

2013English

Decomposition With Respect to Outputs for Boolean Control Networks

IFAC Proceedings Volumes
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy