scientific article; zbMATH DE number 7559228

DOI10.4230/LIPIcs.SoCG.2019.28MaRDI QIDQ5088958

Jeff M. Phillips, Anne Driemel, Ioannis Psarros

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

VC dimensionHausdorff distanceFréchet distance

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Approximating ( k,ℓ )-Median Clustering for Polygonal Curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new upper bound for the VC-dimension of visibility regions
• VC dimensions of principal component analysis
• Guarding galleries where no point sees a small area.
• Quasi-optimal range searching in spaces of finite VC-dimension
• Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
• Almost optimal set covers in finite VC-dimension
• Approximate matching of polygonal shapes
• Fast Fréchet queries
• Fast algorithms for approximate Fréchet matching queries in geometric trees
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• Learnability and the Vapnik-Chervonenkis dimension
• Clustering time series under the Fréchet distance
• Neural Network Learning
• Straight-Path Queries in Trajectory Data
• Comparing distributions and shapes using the kernel distance
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

This page was built for publication: