Saved in:
| Main Authors: | Mikkelstrup, Christian Møller, Dahl, Anders Bjorholm, Bille, Philip, Dahl, Vedrana Andersen, Gørtz, Inge Li |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.13402 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Fast Practical Compression of Deterministic Finite Automata
by: Bille, Philip, et al.
Published: (2023)
by: Bille, Philip, et al.
Published: (2023)
Succinct Data Structures for Segments
by: Bille, Philip, et al.
Published: (2024)
by: Bille, Philip, et al.
Published: (2024)
Improved Extended Regular Expression Matching
by: Bille, Philip, et al.
Published: (2025)
by: Bille, Philip, et al.
Published: (2025)
String Indexing with Compressed Patterns
by: Bille, Philip, et al.
Published: (2019)
by: Bille, Philip, et al.
Published: (2019)
Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
by: Bille, Philip, et al.
Published: (2024)
by: Bille, Philip, et al.
Published: (2024)
Compressed Dictionary Matching on Run-Length Encoded Strings
by: Bille, Philip, et al.
Published: (2025)
by: Bille, Philip, et al.
Published: (2025)
Differentially Private Substring and Document Counting with Near-Optimal Error
by: Bernardini, Giulia, et al.
Published: (2024)
by: Bernardini, Giulia, et al.
Published: (2024)
String Indexing for Top-$k$ Close Consecutive Occurrences
by: Bille, Philip, et al.
Published: (2020)
by: Bille, Philip, et al.
Published: (2020)
Diffusion Based Ambiguous Image Segmentation
by: Christensen, Jakob Lønborg, et al.
Published: (2025)
by: Christensen, Jakob Lønborg, et al.
Published: (2025)
Towards Agnostic and Holistic Universal Image Segmentation with Bit Diffusion
by: Christensen, Jakob Lønborg, et al.
Published: (2026)
by: Christensen, Jakob Lønborg, et al.
Published: (2026)
The Fine-Grained Complexity of Episode Matching
by: Bille, Philip, et al.
Published: (2021)
by: Bille, Philip, et al.
Published: (2021)
Gapped String Indexing in Subquadratic Space and Sublinear Query Time
by: Bille, Philip, et al.
Published: (2022)
by: Bille, Philip, et al.
Published: (2022)
Rethinking Uncertainty Quantification and Entanglement in Image Segmentation
by: Christensen, Jakob Lønborg, et al.
Published: (2026)
by: Christensen, Jakob Lønborg, et al.
Published: (2026)
Fast Isotropic Median Filtering
by: Weiss, Ben
Published: (2025)
by: Weiss, Ben
Published: (2025)
BugNIST -- a Large Volumetric Dataset for Object Detection under Domain Shift
by: Jensen, Patrick Møller, et al.
Published: (2023)
by: Jensen, Patrick Møller, et al.
Published: (2023)
Hadamard Row-Wise Generation Algorithm
by: Monroy, Brayan, et al.
Published: (2024)
by: Monroy, Brayan, et al.
Published: (2024)
VoDaSuRe: A Large-Scale Dataset Revealing Domain Shift in Volumetric Super-Resolution
by: Høeg, August Leander, et al.
Published: (2026)
by: Høeg, August Leander, et al.
Published: (2026)
A Joint Sparse Self-Representation Learning Method for Multiview Clustering
by: Jia, Mengxue, et al.
Published: (2025)
by: Jia, Mengxue, et al.
Published: (2025)
Group Testing for Accurate and Efficient Range-Based Near Neighbor Search for Plagiarism Detection
by: Shah, Harsh, et al.
Published: (2023)
by: Shah, Harsh, et al.
Published: (2023)
A Unified Framework for Integer Programming Formulation of Graph Matching Problems
by: Alidaee, Bahram, et al.
Published: (2024)
by: Alidaee, Bahram, et al.
Published: (2024)
An Optimal Algorithm for Stochastic Vertex Cover
by: Brand, Jan van den, et al.
Published: (2026)
by: Brand, Jan van den, et al.
Published: (2026)
A Simple and Fast Algorithm for Fair Cuts
by: Li, Jason, et al.
Published: (2024)
by: Li, Jason, et al.
Published: (2024)
Size-constrained Weighted Ancestors with Applications
by: Bille, Philip, et al.
Published: (2023)
by: Bille, Philip, et al.
Published: (2023)
How many users have been here for a long time? Efficient solutions for counting long aggregated visits
by: Afshani, Peyman, et al.
Published: (2026)
by: Afshani, Peyman, et al.
Published: (2026)
Probabilistic Kernel Function for Fast Angle Testing
by: Lu, Kejing, et al.
Published: (2025)
by: Lu, Kejing, et al.
Published: (2025)
Learning Tree-Structured Composition of Data Augmentation
by: Li, Dongyue, et al.
Published: (2024)
by: Li, Dongyue, et al.
Published: (2024)
Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
by: Lu, Kejing, et al.
Published: (2024)
by: Lu, Kejing, et al.
Published: (2024)
Low-complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform
by: Oliveira, P. A. M., et al.
Published: (2016)
by: Oliveira, P. A. M., et al.
Published: (2016)
Fast Algorithms for Graph Arboricity and Related Problems
by: Cen, Ruoxu, et al.
Published: (2025)
by: Cen, Ruoxu, et al.
Published: (2025)
Fast Sphericity and Roundness approximation in 2D and 3D using Local Thickness
by: Pieta, Pawel Tomasz, et al.
Published: (2025)
by: Pieta, Pawel Tomasz, et al.
Published: (2025)
Cut-Query Algorithms with Few Rounds
by: Kenneth-Mordoch, Yotam, et al.
Published: (2025)
by: Kenneth-Mordoch, Yotam, et al.
Published: (2025)
Sketching Cuts in Graphs and Hypergraphs
by: Kogan, Dmitry, et al.
Published: (2014)
by: Kogan, Dmitry, et al.
Published: (2014)
Parallel Algorithm For Finding The Minimum s/t Cut in a Structured 3-Dimensional Proper Order Graph
by: Chandramouli, Shridharan
Published: (2026)
by: Chandramouli, Shridharan
Published: (2026)
Faster Algorithms for Graph Monopolarity
by: Philip, Geevarghese, et al.
Published: (2024)
by: Philip, Geevarghese, et al.
Published: (2024)
Streaming Algorithms via Local Algorithms for Maximum Directed Cut
by: Saxena, Raghuvansh R., et al.
Published: (2024)
by: Saxena, Raghuvansh R., et al.
Published: (2024)
Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
by: Cervenjak, Philip, et al.
Published: (2023)
by: Cervenjak, Philip, et al.
Published: (2023)
Matching (Multi)Cut: Algorithms, Complexity, and Enumeration
by: Gomes, Guilherme C. M., et al.
Published: (2024)
by: Gomes, Guilherme C. M., et al.
Published: (2024)
Learning-Augmented Scalable Linear Assignment Problem Optimization via Neural Dual Warm-Starts
by: Yavlovich, Ilay, et al.
Published: (2026)
by: Yavlovich, Ilay, et al.
Published: (2026)
Choosing Public Datasets for Private Machine Learning via Gradient Subspace Distance
by: Gu, Xin, et al.
Published: (2023)
by: Gu, Xin, et al.
Published: (2023)
Local Max-Cut on Sparse Graphs
by: Schwartzman, Gregory
Published: (2023)
by: Schwartzman, Gregory
Published: (2023)
Similar Items
-
Fast Practical Compression of Deterministic Finite Automata
by: Bille, Philip, et al.
Published: (2023) -
Succinct Data Structures for Segments
by: Bille, Philip, et al.
Published: (2024) -
Improved Extended Regular Expression Matching
by: Bille, Philip, et al.
Published: (2025) -
String Indexing with Compressed Patterns
by: Bille, Philip, et al.
Published: (2019) -
Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
by: Bille, Philip, et al.
Published: (2024)