No article text was recorded for this version.
fill-in minimization
Version 1 of 132 papers40 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Fast Incremental Square Root Information Smoothing
- Blog: Accelerated Parallel Numerical Simulation of Large-Scale Nuclear Reactor Thermal Hydraulic Models by Renumbering Methods
- Blog: Comparing Different Approaches for Solving Large Scale Power-Flow Problems With the Newton-Raphson Method
- Blog: Efficient numerical methods for gas network modeling and simulation
- Blog: Efficient Mining Algorithms for Large-scale Graphs
- Blog: A Fast Solver for HSS Representations via Sparse Matrices
- Blog: Fast and Exact Top-k Search for Random Walk with Restart
- Blog: Efficiently Dispatching Flash Attention For Partially Filled Attention Masks
- Blog: Global Selection of Contrastive Batches via Optimization on Sample Permutations
- Blog: An accelerated Levin–Clenshaw–Curtis method for the evaluation of highly oscillatory integrals
- Blog: Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks
- Blog: Measuring Collectiveness in Crowded Scenes via Link Prediction
- Blog: Computation in Large-Scale Scientific and Internet Data Applications is a Focus of MMDS 2010
- Blog: The Reverse Cuthill-McKee Algorithm in Distributed-Memory
- Blog: Log(graph): a near-optimal high-performance graph representation
- Blog: Learning chordal extensions
- Blog: CLUDE: An Efficient Algorithm for LU Decomposition Over a Sequence of Evolving Graphs
- Blog: Graph Generation with $K^2$-trees
- Blog: Improving Graph Generation by Restricting Graph Bandwidth
- Blog: NeuKron: Constant-Size Lossy Compression of Sparse Reorderable Matrices and Tensors
- Blog: Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
- Blog: Incremental Sparse GP Regression for Continuous-time Trajectory Estimation & Mapping
- Blog: Markov models for fMRI correlation structure: Is brain functional connectivity small world, or decomposable into networks?
- Blog: Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication
- Blog: Adaptive Algebraic Reuse of Reordering in Cholesky Factorizations with Dynamic Sparsity Patterns
- Blog: High Performance Unstructured SpMM Computation Using Tensor Cores
- Blog: sTiles: An Accelerated Computational Framework for Sparse Factorizations of Structured Matrices
- Blog: A New Node Centroid Algorithm for Bandwidth Minimization
- Blog: Accelerating FVM-Based Parallel Fluid Simulations with Better Grid Renumbering Methods
- Blog: Computing low-rank approximations of large-scale matrices with the Tensor Network randomized SVD
- Blog: A Multifrontal QR Factorization Approach to Distributed Inference Applied to Multirobot Localization and Mapping
- Blog: Graph Generation with K2-trees
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_fill_in_minimization_418e3b35,
title = {fill-in minimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fill-in-minimization/rdr_418e3b3512354b6cb32f78fa2f389739},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_fill_in_minimization_418e3b35_v1,
title = {fill-in minimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fill-in-minimization/rdr_418e3b3512354b6cb32f78fa2f389739/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}