Image de couverture de livre

Robust Classification of Dynamic Bichromatic point Sets in R2

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Glazenburg, Erwin, Staals, Frank, van Kreveld, Marc
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry 68W40 (primary), 68W25 (secondary)
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On strictly output sensitive color frequency reporting
par: Glazenburg, Erwin, et autres
Publié: (2026)

Multipole Semantic Attention: A Fast Approximation of Softmax Attention for Pretraining
par: Mitchell, Rupert, et autres
Publié: (2025)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
par: Andreou, Pantelis, et autres
Publié: (2024)

Iterated Resultants and Rational Functions in Real Quantifier Elimination
par: Davenport, James H., et autres
Publié: (2023)

Worst-Case Examples for the Computation of Persistent Homology
par: Çetin, Uzay, et autres
Publié: (2026)

Random-Order Online Independent Set of Intervals and Hyperrectangles
par: Garg, Mohit, et autres
Publié: (2024)

Robust Bichromatic Classification using Two Lines
par: Glazenburg, Erwin, et autres
Publié: (2024)

Shortest Paths without a Map, but with an Entropic Regularizer
par: Bubeck, Sébastien, et autres
Publié: (2022)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
par: Friggstad, Zachary, et autres
Publié: (2018)

Point Location in Constant Time
par: Chaganti, Sairam, et autres
Publié: (2023)

A Framework for Efficient Approximation Schemes on Geometric Packing Problems of $d$-dimensional Fat Objects
par: Chagas, Vítor Gomes, et autres
Publié: (2024)

On the complex zeros and the computational complexity of approximating the reliability polynomial
par: Bencs, Ferenc, et autres
Publié: (2025)

Runtime Analyses of NSGA-III on Many-Objective Problems
par: Opris, Andre, et autres
Publié: (2024)

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
par: Grobben, Kobe, et autres
Publié: (2025)

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

Polynomial-Time Algorithms for Black-Box Distributive Expanded Groups
par: Anokhin, Mikhail
Publié: (2025)

D-Algebraic Functions
par: Manssour, Rida Ait El, et autres
Publié: (2023)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
par: Chen, Zongchen, et autres
Publié: (2022)

Sum-of-Gaussians tensor neural networks for high-dimensional Schrödinger equation
par: Zhou, Qi, et autres
Publié: (2025)

Rigorous methods for computational number theory
par: de Boer, Koen, et autres
Publié: (2025)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
par: Opris, Andre
Publié: (2025)

Finding Complex Patterns in Trajectory Data via Geometric Set Cover
par: Conradi, Jacobus, et autres
Publié: (2023)

The Shift-Dimension of Multipersistence Modules
par: Chachólski, Wojciech, et autres
Publié: (2021)

Improved bounds for randomized Schatten norm estimation of numerically low-rank matrices
par: Chu, Ya-Chi, et autres
Publié: (2024)

Optimal Discretization is Fixed-parameter Tractable
par: Kratsch, Stefan, et autres
Publié: (2020)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
par: Hougardy, Stefan, et autres
Publié: (2025)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
par: Matti, Fabio, et autres
Publié: (2025)

Sub-Token Routing in LoRA for Adaptation and Query-Aware KV Compression
par: Jiang, Wei, et autres
Publié: (2026)

Exact asymptotic order for generalised adaptive approximations
par: Kesseböhmer, Marc, et autres
Publié: (2023)

Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better
par: Conradi, Jacobus, et autres
Publié: (2025)

Building a Nest by an Automaton
par: Czyzowicz, Jurek, et autres
Publié: (2019)

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
par: Doerr, Benjamin, et autres
Publié: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
par: Sopp, Braeden, et autres
Publié: (2026)

Conservative Maltsev Constraint Satisfaction Problems
par: Bodirsky, Manuel, et autres
Publié: (2025)

Counting All Lattice Rectangles in the Square Grid in Near-Linear Time
par: Babichev, Dmitry, et autres
Publié: (2026)

Curvature surfaces in generic conformally flat hypersurfaces arising from Poincaré metric -- Extension and Approximation
par: Matsuura, Nozomu, et autres
Publié: (2023)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
par: Opris, Andre
Publié: (2025)

Balanced Group Convolution: An Improved Group Convolution Based on Approximability Estimates
par: Lee, Youngkyu, et autres
Publié: (2023)