Image de couverture de livre

A Query-Driven Approach to Space-Efficient Range Searching

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fotakis, Dimitris, Kalavas, Andreas, Psarros, Ioannis
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Computational Geometry Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Efficient Parameter Estimation of Truncated Boolean Product Distributions
par: Fotakis, Dimitris, et autres
Publié: (2020)

Space-Efficient Approximate Spherical Range Counting in High Dimensions
par: Kalavas, Andreas, et autres
Publié: (2026)

Graph-Based Nearest-Neighbor Search without the Spread
par: Giliberti, Jeff, et autres
Publié: (2026)

Improved Bounds for Online Facility Location with Predictions
par: Fotakis, Dimitris, et autres
Publié: (2021)

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
par: Abbasi, Fateme, et autres
Publié: (2023)

Data Structures for Range Sorted Consecutive Occurrence Queries
par: Akram, Waseem, et autres
Publié: (2024)

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
par: de Berg, Sarita, et autres
Publié: (2023)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
par: Diwan, Haya, et autres
Publié: (2024)

The Query Complexity of Local Search in Rounds on General Graphs
par: Brânzei, Simina, et autres
Publié: (2026)

Retroactive Monotonic Priority Queues via Range Searching
par: Castro, Lucas, et autres
Publié: (2025)

A Tight VC-Dimension Analysis of Clustering Coresets with Applications
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves
par: Krivošija, Amer, et autres
Publié: (2025)

Repeated Descent: A Framework for Online Budget-Feasible Auctions
par: Charalampopoulos, Andreas, et autres
Publié: (2026)

Fast Agnostic Learners in the Plane
par: Eden, Talya, et autres
Publié: (2025)

Coresets for Clustering Under Stochastic Noise
par: Huang, Lingxiao, et autres
Publié: (2025)

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
par: Greenhut, Daniel, et autres
Publié: (2025)

Coreset for Robust Geometric Median: Eliminating Size Dependency on Outliers
par: Fang, Ziyi, et autres
Publié: (2025)

Terminal Embeddings in Sublinear Time
par: Cherapanamjeri, Yeshwanth, et autres
Publié: (2021)

Hardness of High-Dimensional Linear Classification
par: Munteanu, Alexander, et autres
Publié: (2026)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
par: Iacono, John, et autres
Publié: (2025)

Visibility Queries in Simple Polygons
par: Bhore, Sujoy, et autres
Publié: (2026)

Exact Learning of Weighted Graphs Using Composite Queries
par: Goodrich, Michael T., et autres
Publié: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
par: Kalavas, Andreas, et autres
Publié: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
par: Kalavas, Andreas, et autres
Publié: (2025)

Top-k Stabbing Interval Queries
par: Akram, Waseem, et autres
Publié: (2024)

A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
par: Charalampopoulos, Andreas, et autres
Publié: (2025)

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
par: Gudmundsson, Joachim, et autres
Publié: (2022)

Range Counting Oracles for Geometric Problems
par: Driemel, Anne, et autres
Publié: (2025)

Dynamic Unit-Disk Range Reporting
par: Wang, Haitao, et autres
Publié: (2024)

Using Ray-shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs
par: Biedl, Therese, et autres
Publié: (2026)

A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
par: Gusain, Rachana, et autres
Publié: (2025)

On Approximability of $\ell_2^2$ Min-Sum Clustering
par: S., Karthik C., et autres
Publié: (2024)

Impossibility of Depth Reduction in Explainable Clustering
par: Deng, Chengyuan, et autres
Publié: (2023)

A near-linear time approximation scheme for $(k,\ell)$-median clustering under discrete Fréchet distance
par: Driemel, Anne, et autres
Publié: (2025)

Query-Efficient Correlation Clustering with Noisy Oracle
par: Kuroki, Yuko, et autres
Publié: (2024)

Space Complexity of Euclidean Clustering
par: Zhu, Xiaoyi, et autres
Publié: (2024)

Optimal-Cost Construction of Shallow Cuttings for 3-D Dominance Ranges in the I/O-Model
par: Nekrich, Yakov, et autres
Publié: (2026)

Optimal Trajectories in Discrete Space with Acceleration Constraints
par: Casteigts, Arnaud, et autres
Publié: (2026)

Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing
par: Ahrens, Markus, et autres
Publié: (2021)

Optimal Window Queries on Line Segments using the Trapezoidal Search DAG
par: Brankovic, Milutin, et autres
Publié: (2021)