Image de couverture de livre

Sparse Graph Reconstruction and Seriation for Large-Scale Image Stacks

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yang, Fuming, Meirovitch, Yaron, Lichtman, Jeff W.
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Sum-of-Squares Lower Bounds for Independent Set in Ultra-Sparse Random Graphs
par: Kothari, Pravesh, et autres
Publié: (2024)

Distance Reconstruction of Sparse Random Graphs
par: Bastide, Paul
Publié: (2024)

Listing 6-Cycles in Sparse Graphs
par: Williams, Virginia Vassilevska, et autres
Publié: (2024)

Local Max-Cut on Sparse Graphs
par: Schwartzman, Gregory
Publié: (2023)

BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers
par: Wheatman, Brian, et autres
Publié: (2024)

Efficient Trace Frequency Queries in Sparse Graphs
par: Awofeso, Christine, et autres
Publié: (2025)

Graph Reconstruction via MIS Queries
par: Konrad, Christian, et autres
Publié: (2024)

Algebraic Vertex Ordering of a Sparse Graph for Adjacency Access Locality and Graph Compression
par: Floros, Dimitris, et autres
Publié: (2024)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
par: Fan, Zhuochen, et autres
Publié: (2024)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
par: Khanna, Sanjeev, et autres
Publié: (2025)

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
par: Mallek, Nadym, et autres
Publié: (2025)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
par: Łącki, Jakub, et autres
Publié: (2025)

Graph Reconstruction with a Connected Components Oracle
par: Harviainen, Juha, et autres
Publié: (2025)

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
par: Eppstein, David, et autres
Publié: (2025)

Tera-Scale Multilevel Graph Partitioning
par: Salwasser, Daniel, et autres
Publié: (2024)

When is String Reconstruction using de Bruijn Graphs Hard?
par: Bals, Ben, et autres
Publié: (2025)

On Minimizing Wiggle in Stacked Area Charts
par: Dobler, Alexander, et autres
Publié: (2025)

Routing on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem
par: O'Hara, Patrick, et autres
Publié: (2024)

Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach
par: Yang, Yichun, et autres
Publié: (2024)

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
par: Ma, Xinran, et autres
Publié: (2025)

Streaming Complexity Separations for Dense and Sparse Graphs
par: Liu, Yang P., et autres
Publié: (2026)

Maximization of Approximately Submodular Functions
par: Horel, Thibaut, et autres
Publié: (2024)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
par: De Man, Quinten, et autres
Publié: (2026)

Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More
par: Jin, Ce, et autres
Publié: (2024)

On the Approximability of Max-Cut on 3-Colorable Graphs and Graphs with Large Independent Sets
par: Ghoshal, Suprovat, et autres
Publié: (2026)

Online Coloring for Graphs of Large Odd Girth
par: Yoneda, Hirotaka, et autres
Publié: (2026)

How to Train Your Filter: Should You Learn, Stack or Adapt?
par: Sabale, Diandre Miguel, et autres
Publié: (2026)

Improved parallel derandomization via finite automata with applications
par: Giliberti, Jeff, et autres
Publié: (2024)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
par: Gottesbüren, Lars, et autres
Publié: (2024)

Scalable Similarity Search over Large Attributed Bipartite Graphs
par: Ou, Xi, et autres
Publié: (2025)

Approximating Small Sparse Cuts
par: Anand, Aditya, et autres
Publié: (2024)

Sparse Outerstring Graphs Have Logarithmic Treewidth
par: An, Shinwoo, et autres
Publié: (2024)

Sparse Random Matrices for Dimensionality Reduction
par: Mackenzie, Pierre
Publié: (2025)

Revisiting the Sparse Matrix Compression Problem
par: Jugé, Vincent, et autres
Publié: (2026)

Testing Sparse Functions over the Reals
par: Arora, Vipul, et autres
Publié: (2026)

An Improved Algorithm for Sparse Instances of SAT
par: Jain, Sanjay, et autres
Publié: (2024)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
par: Sun, Ming, et autres
Publié: (2022)

Improved Sparse Recovery for Approximate Matrix Multiplication
par: Uffenheimer, Yahel, et autres
Publié: (2026)

Fully Dynamic Shortest Paths in Sparse Digraphs
par: Karczmarz, Adam, et autres
Publié: (2024)

Accurate and Fast Approximate Graph Pattern Mining at Scale
par: Arpaci-Dusseau, Anna, et autres
Publié: (2024)