Cover Image

On strictly output sensitive color frequency reporting

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Glazenburg, Erwin, Staals, Frank
Format:	Preprint
Published:	2026
Subjects:	Computational Geometry 68W40
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Robust Classification of Dynamic Bichromatic point Sets in R2
by: Glazenburg, Erwin, et al.
Published: (2024)

Point Location in Constant Time
by: Chaganti, Sairam, et al.
Published: (2023)

Counting All Lattice Rectangles in the Square Grid in Near-Linear Time
by: Babichev, Dmitry, et al.
Published: (2026)

Finding Complex Patterns in Trajectory Data via Geometric Set Cover
by: Conradi, Jacobus, et al.
Published: (2023)

Robust Bichromatic Classification using Two Lines
by: Glazenburg, Erwin, et al.
Published: (2024)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)

Sub-Token Routing in LoRA for Adaptation and Query-Aware KV Compression
by: Jiang, Wei, et al.
Published: (2026)

Optimal Discretization is Fixed-parameter Tractable
by: Kratsch, Stefan, et al.
Published: (2020)

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

Euclidean k-center Fair Clusterings
by: Moritaka, Ayano, et al.
Published: (2025)

A Framework for Efficient Approximation Schemes on Geometric Packing Problems of $d$-dimensional Fat Objects
by: Chagas, Vítor Gomes, et al.
Published: (2024)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)

Building a Nest by an Automaton
by: Czyzowicz, Jurek, et al.
Published: (2019)

Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls
by: Bigham, Bahram Sadeghi
Published: (2021)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Runtime Analyses of NSGA-III on Many-Objective Problems: Provable Exponential Speedup via Stochastic Population Update
by: Opris, Andre
Published: (2025)

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
by: Doerr, Benjamin, et al.
Published: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

Sum-of-Gaussians tensor neural networks for high-dimensional Schrödinger equation
by: Zhou, Qi, et al.
Published: (2025)

Balanced Group Convolution: An Improved Group Convolution Based on Approximability Estimates
by: Lee, Youngkyu, et al.
Published: (2023)

Curvature surfaces in generic conformally flat hypersurfaces arising from Poincaré metric -- Extension and Approximation
by: Matsuura, Nozomu, et al.
Published: (2023)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
by: Opris, Andre, et al.
Published: (2024)

An algorithm for annihilator and Bernstein-Sato polynomial of a rational function
by: González-Villa, Manuel, et al.
Published: (2026)

NP-membership for the boundary-boundary art-gallery problem
by: Stade, Jack
Published: (2025)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
by: Grobben, Kobe, et al.
Published: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

Bridging the Gap in Hybrid Decision-Making Systems
by: Mazzoni, Federico, et al.
Published: (2024)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

A note on Erdős's mysterious remark
by: Kovács, Zoltán
Published: (2024)

Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better
by: Conradi, Jacobus, et al.
Published: (2025)

On 3-colorability of (claw, diamond)-free graphs
by: Hodur, Nadzieja, et al.
Published: (2026)

Fast computation of integral bases
by: Poteaux, Adrien, et al.
Published: (2024)

Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
by: Oki, Taihei, et al.
Published: (2022)

A Morton-Type Space-Filling Curve for Pyramid Subdivision and Hybrid Adaptive Mesh Refinement
by: Knapp, David, et al.
Published: (2026)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
by: Matti, Fabio, et al.
Published: (2025)

Extensions of the regret-minimization algorithm for optimal design
by: Chen, Youguang, et al.
Published: (2025)

$(1+\varepsilon)$-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension
by: Conradi, Jacobus, et al.
Published: (2023)

Naively Sorting Evolving Data is Optimal and Robust
by: Giakkoupis, George, et al.
Published: (2024)