scientific article; zbMATH DE number 7559380

DOI10.4230/LIPICS.MFCS.2020.9MaRDI QIDQ5089169zbMATH OpenFDO

Authors Elad Sulami, Boris Aronov, Matthew J. Katz

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2020.9

zbMATH Keywords

clusteringdistance oracledynamic time warpingnearest-neighbor search

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A MATHEMATICAL THEORY OF ADAPTIVE CONTROL PROCESSES
• An optimal convex hull algorithm in any fixed dimension
• Computing Envelopes in Four Dimensions with Applications
• Dynamic time warping and geometric edit distance: breaking the quadratic barrier
• scientific article; zbMATH DE number 7236441 (Why is no real title available?)
• On ray shooting in convex polytopes
• Optimal partition trees
• The maximum numbers of faces of a convex polytope
• The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
• The upper envelope of piecewise linear functions: Algorithms and applications
• The upper envelope of Voronoi surfaces and its applications

Cited in

(2)

• Adaptive dissimilarity index for measuring time series proximity
• Dynamic closest pairs — A probabilistic approach

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089169)