Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Probabilistic embeddings of the Fréchet distance

From MaRDI portal
Publication:1757772
Jump to:navigation, search

DOI10.1007/978-3-030-04693-4_14OpenAlexW2885643357MaRDI QIDQ1757772FDOQ1757772


Authors: Anne Driemel, Amer Krivošija Edit this on Wikidata


Publication date: 15 January 2019


Full work available at URL: https://arxiv.org/abs/1808.01983




Recommendations

  • Fréchet Distance for Curves, Revisited
  • COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
  • Locality-sensitive hashing of curves
  • Approximating the Fréchet distance for realistic curves in near linear time
  • Computing the Fréchet distance with a retractable leash


zbMATH Keywords

random projectionsmetric embeddingsFréchet distance


Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Approximation algorithms (68W25)



Cited In (7)

  • Approximating the packedness of polygonal curves
  • Random embeddings with an almost Gaussian distortion
  • Locality-sensitive hashing of curves
  • Random projections for curves in high dimensions
  • Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance
  • Title not available (Why is that?)
  • Approximating the Packedness of Polygonal Curves





This page was built for publication: Probabilistic embeddings of the Fréchet distance

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1757772&oldid=14100100"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 07:06. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki