Graph compression for adjacency-matrix multiplication

AP Francisco, T Gagie, D Köppl, S Ladra… - SN Computer …, 2022 - Springer
Computing the product of the (binary) adjacency matrix of a large graph with a real-valued
vector is an important operation that lies at the heart of various graph analysis tasks, such as …

On large-scale matrix-matrix multiplication on compressed structures

SG Krishna, A Narasimhan… - … Conference on Big …, 2021 - ieeexplore.ieee.org
Matrix multiplication is an essential operation in the field of mathematics and computer
science. Many critical computations, such as matrix factorization and graph computations …

Exploiting computation-friendly graph compression methods for adjacency-matrix multiplication

A Francisco, T Gagie, S Ladra… - 2018 Data Compression …, 2018 - ieeexplore.ieee.org
Computing the product of the (binary) adjacency matrix of a large graph with a real-valued
vector is an important operation that lies at the heart of various graph analysis tasks, such as …

Billion-scale matrix compression and multiplication with implications in data mining

M Nelson, S Radhakrishnan… - 2019 IEEE 20th …, 2019 - ieeexplore.ieee.org
Billion-scale Boolean matrices in the era of big data occupy storage that is measured in
100's of petabytes to zetabytes. The fundamental operation on these matrices for data …

[HTML][HTML] Boosting over non-deterministic ZDDs

T Fujita, K Hatano, E Takimoto - Theoretical computer science, 2020 - Elsevier
We propose a new approach to large-scale machine learning, learning over compressed
data: First compress the training data somehow and then employ various machine learning …

Extended Formulations via Decision Diagrams

Y Kurokawa, R Mitsuboshi, H Hamasaki… - International Computing …, 2023 - Springer
We propose a general algorithm of constructing an extended formulation for any given set of
linear constraints with integer coefficients. Our algorithm consists of two phases: first …

[PDF][PDF] Compressing and Performing Algorithms on Massively Large Networks

M Nelson - 2019 - core.ac.uk
A network can be represented as a graph. Most social networks like Facebook are
undirected, meaning that the relationship is mutual. We use the terminology reciprocity or …

[PDF][PDF] Numerical Optimization Methods based on Discrete Structure

M Nishino - Dimension - core.ac.uk
Numerical optimization problems appear in many tasks of natural language processing
(NLP) and machine learning (ML), and have important roles in these areas. For example …

[PDF][PDF] Efficient Algorithms for Online Combinatorial Optimization and Its Application to Learning over Compressed Data

藤田隆寛 - 2018 - catalog.lib.kyushu-u.ac.jp
Online prediction is a theoretical framework of sequential decision making such as weather
forecasting and stock investment. The problem is formulated as a repeated game between …

[PDF][PDF] Numerical Optimization Methods based on Discrete Structure for Text Summarization and Relational Learning

M Nishino - 2014 - repository.kulib.kyoto-u.ac.jp
Numerical optimization problems have an important role in natural language processing
(NLP) and many machine learning (ML) tasks, which are accomplished by first making a …