$(1+\varepsilon)$-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension
Fuente:
arXiv
Guardado en:
| Autores principales: | Conradi, Jacobus, Driemel, Anne, Kolbe, Benedikt |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better
por: Conradi, Jacobus, et al.
Publicado: (2025)
por: Conradi, Jacobus, et al.
Publicado: (2025)
Finding Complex Patterns in Trajectory Data via Geometric Set Cover
por: Conradi, Jacobus, et al.
Publicado: (2023)
por: Conradi, Jacobus, et al.
Publicado: (2023)
Revisiting the Fréchet distance between piecewise smooth curves
por: Conradi, Jacobus, et al.
Publicado: (2024)
por: Conradi, Jacobus, et al.
Publicado: (2024)
How to Compute a Moving Sum
por: Maslen, David K., et al.
Publicado: (2025)
por: Maslen, David K., et al.
Publicado: (2025)
A Framework for Efficient Approximation Schemes on Geometric Packing Problems of $d$-dimensional Fat Objects
por: Chagas, Vítor Gomes, et al.
Publicado: (2024)
por: Chagas, Vítor Gomes, et al.
Publicado: (2024)
Robust Classification of Dynamic Bichromatic point Sets in R2
por: Glazenburg, Erwin, et al.
Publicado: (2024)
por: Glazenburg, Erwin, et al.
Publicado: (2024)
Random-Order Online Independent Set of Intervals and Hyperrectangles
por: Garg, Mohit, et al.
Publicado: (2024)
por: Garg, Mohit, et al.
Publicado: (2024)
Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
por: Opris, Andre
Publicado: (2025)
por: Opris, Andre
Publicado: (2025)
The Li-Chao Tree: Algorithm Specification and Analysis
por: Li, Chao
Publicado: (2026)
por: Li, Chao
Publicado: (2026)
Transfers and Unstable Degrees in the $\mathbb{A}^{1}$-Brouwer Degrees Package for Macaulay2
por: Atherton, Stephanie, et al.
Publicado: (2025)
por: Atherton, Stephanie, et al.
Publicado: (2025)
Strongly Sublinear Algorithms for Testing Pattern Freeness
por: Newman, Ilan, et al.
Publicado: (2021)
por: Newman, Ilan, et al.
Publicado: (2021)
On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
por: DasGupta, Bhaskar, et al.
Publicado: (2026)
por: DasGupta, Bhaskar, et al.
Publicado: (2026)
A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
por: Hougardy, Stefan, et al.
Publicado: (2025)
por: Hougardy, Stefan, et al.
Publicado: (2025)
Point Location in Constant Time
por: Chaganti, Sairam, et al.
Publicado: (2023)
por: Chaganti, Sairam, et al.
Publicado: (2023)
Geometric complexity theory for product-plus-power
por: Dutta, Pranjal, et al.
Publicado: (2022)
por: Dutta, Pranjal, et al.
Publicado: (2022)
Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
por: Opris, Andre, et al.
Publicado: (2024)
por: Opris, Andre, et al.
Publicado: (2024)
Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
por: Cai, HanQin, et al.
Publicado: (2023)
por: Cai, HanQin, et al.
Publicado: (2023)
Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
por: Gu, Qian-Ping, et al.
Publicado: (2025)
por: Gu, Qian-Ping, et al.
Publicado: (2025)
Sketched and Truncated Polynomial Krylov Subspace Methods: Matrix Sylvester Equations
por: Palitta, Davide, et al.
Publicado: (2023)
por: Palitta, Davide, et al.
Publicado: (2023)
Certified Real Eigenvalue Location
por: Solmaz, Baran, et al.
Publicado: (2026)
por: Solmaz, Baran, et al.
Publicado: (2026)
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
por: Friggstad, Zachary, et al.
Publicado: (2018)
por: Friggstad, Zachary, et al.
Publicado: (2018)
Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
por: Chen, Zongchen, et al.
Publicado: (2022)
por: Chen, Zongchen, et al.
Publicado: (2022)
Decentralized Optimization in Networks with Arbitrary Delays
por: Ortega, Tomas, et al.
Publicado: (2024)
por: Ortega, Tomas, et al.
Publicado: (2024)
Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
por: Michel, Stefan
Publicado: (2025)
por: Michel, Stefan
Publicado: (2025)
An arithmetic method algorithm optimizing k-nearest neighbors compared to regression algorithms and evaluated on real world data sources
por: Anagnostopoulos, Theodoros, et al.
Publicado: (2026)
por: Anagnostopoulos, Theodoros, et al.
Publicado: (2026)
On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
por: Zhong, Xianghui
Publicado: (2019)
por: Zhong, Xianghui
Publicado: (2019)
An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
por: Mundhra, S.
Publicado: (2025)
por: Mundhra, S.
Publicado: (2025)
Quasi-optimal hierarchically semi-separable matrix approximation
por: Amsel, Noah, et al.
Publicado: (2025)
por: Amsel, Noah, et al.
Publicado: (2025)
Extending Exact Integrality Gap Computations for the Metric TSP
por: Cook, William, et al.
Publicado: (2026)
por: Cook, William, et al.
Publicado: (2026)
On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
por: Heimann, Sophia, et al.
Publicado: (2026)
por: Heimann, Sophia, et al.
Publicado: (2026)
Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
por: Feldman, Moran, et al.
Publicado: (2026)
por: Feldman, Moran, et al.
Publicado: (2026)
Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
por: Matti, Fabio, et al.
Publicado: (2025)
por: Matti, Fabio, et al.
Publicado: (2025)
Runtime Analyses of NSGA-III on Many-Objective Problems
por: Opris, Andre, et al.
Publicado: (2024)
por: Opris, Andre, et al.
Publicado: (2024)
A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
por: Opris, Andre
Publicado: (2025)
por: Opris, Andre
Publicado: (2025)
Beyond Low Rank: Fast Low-Rank + Diagonal Decomposition with a Spectral Approach
por: Yeon, Kingsley, et al.
Publicado: (2025)
por: Yeon, Kingsley, et al.
Publicado: (2025)
Decentralized Optimization in Time-Varying Networks with Arbitrary Delays
por: Ortega, Tomas, et al.
Publicado: (2024)
por: Ortega, Tomas, et al.
Publicado: (2024)
Accelerating Newton-Schulz Iteration for Orthogonalization via Chebyshev-type Polynomials
por: Grishina, Ekaterina, et al.
Publicado: (2025)
por: Grishina, Ekaterina, et al.
Publicado: (2025)
Algorithmic Barriers to Detecting and Repairing Structural Overspecification in Adaptive Data-Structure Selection
por: Alpay, Faruk, et al.
Publicado: (2026)
por: Alpay, Faruk, et al.
Publicado: (2026)
Transforming Dogs on the Line: On the Fréchet Distance Under Translation or Scaling in 1D
por: Blank, Lotte, et al.
Publicado: (2025)
por: Blank, Lotte, et al.
Publicado: (2025)
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
por: Heimann, Sophia, et al.
Publicado: (2025)
por: Heimann, Sophia, et al.
Publicado: (2025)
Ejemplares similares
-
Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better
por: Conradi, Jacobus, et al.
Publicado: (2025) -
Finding Complex Patterns in Trajectory Data via Geometric Set Cover
por: Conradi, Jacobus, et al.
Publicado: (2023) -
Revisiting the Fréchet distance between piecewise smooth curves
por: Conradi, Jacobus, et al.
Publicado: (2024) -
How to Compute a Moving Sum
por: Maslen, David K., et al.
Publicado: (2025) -
A Framework for Efficient Approximation Schemes on Geometric Packing Problems of $d$-dimensional Fat Objects
por: Chagas, Vítor Gomes, et al.
Publicado: (2024)