Image de couverture de livre

Finding Complex Patterns in Trajectory Data via Geometric Set Cover

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Conradi, Jacobus, Driemel, Anne
Format:	Preprint
Publié:	2023
Sujets:	Computational Geometry 68W40, 68U05 F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

$(1+\varepsilon)$-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension
par: Conradi, Jacobus, et autres
Publié: (2023)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
par: Michel, Stefan
Publié: (2025)

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

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

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

Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls
par: Bigham, Bahram Sadeghi
Publié: (2021)

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

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
par: Hommelsheim, Felix
Publié: (2025)

The Li-Chao Tree: Algorithm Specification and Analysis
par: Li, Chao
Publié: (2026)

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

On the difficulty of order constrained pattern matching with applications to feature matching based malware detection
par: Liyanage, Adiesha, et autres
Publié: (2025)

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

A $4/3$ Approximation for $2$-Vertex-Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2023)

Rotation-Invariant Vectorized Shape Representations
par: Shafieasl, Hamid, et autres
Publié: (2026)

Optimizing Genetic Algorithms Using the Binomial Distribution
par: Cicirello, Vincent A.
Publié: (2024)

An Improved Drift Theorem for Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2023)

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

A $5/4$-Approximation for Two-Edge Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2024)

Naively Sorting Evolving Data is Optimal and Robust
par: Giakkoupis, George, et autres
Publié: (2024)

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
par: Emmerich, Michael T. M., et autres
Publié: (2026)

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

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)

On the Average-Case Performance of Greedy for Maximum Coverage
par: Balkanski, Eric, et autres
Publié: (2026)

NP-membership for the boundary-boundary art-gallery problem
par: Stade, Jack
Publié: (2025)

An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets
par: Flores-Peñaloza, David, et autres
Publié: (2024)

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

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
par: Emmerich, Michael T. M.
Publié: (2026)

An asymptotically optimal algorithm for generating bin cardinalities
par: Devroye, Luc, et autres
Publié: (2024)

The Presort Hierarchy for Geometric Problems
par: van der Hoog, Ivor, et autres
Publié: (2026)

Open Source Evolutionary Computation with Chips-n-Salsa
par: Cicirello, Vincent A.
Publié: (2024)

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

Folding One Polyhedral Metric Graph into Another
par: Chung, Lily, et autres
Publié: (2024)

Computing the second and third systoles of a combinatorial surface
par: Ebbens, Matthijs, et autres
Publié: (2024)

The Distributional Tail of Worst-Case Quickselect
par: Płecha, Witold
Publié: (2026)

Computing shortest closed curves on non-orientable surfaces
par: Bulavka, Denys, et autres
Publié: (2024)

Clustering with Few Disks to Minimize the Sum of Radii
par: Abrahamsen, Mikkel, et autres
Publié: (2023)

Fast FPT Algorithms for Grundy Number on Dense Graphs
par: Nezhad, Sina Ghasemi, et autres
Publié: (2024)

Minimum-cost paths for electric cars
par: Dorfman, Dani, et autres
Publié: (2024)