( en | de | ru )

 

Disambiguation of "Wong, Sampson"

Author of the publication

copydeleteadd this publication to your clipboard
Computing a Subtrajectory Cluster from c-Packed Trajectories.

, , , and . ISAAC, volume 283 of LIPIcs, page 34:1-34:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sampson Asorakos

Georgios Sampson

John Sampson

Georgios Sampson

Cortney Sampson

 

Other publications of authors with the same name

Map matching queries on realistic input graphs under the Fréchet distance., , and . SODA, page 1464-1492. SIAM, (2023)Approximating the Packedness of Polygonal Curves., , and . ISAAC, volume 181 of LIPIcs, page 9:1-9:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Approximating the packedness of polygonal curves., , and . Comput. Geom., (2023)Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance., and . SODA, page 173-189. SIAM, (2022)Approximating the λ-low-density Value., , and . COCOON (1), volume 14422 of Lecture Notes in Computer Science, page 71-82. Springer, (2023)Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time., , and . SoCG, volume 224 of LIPIcs, page 22:1-22:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size., , and . SoCG, volume 293 of LIPIcs, page 62:1-62:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Improving the dilation of a metric graph by adding edges., and . SODA, page 675-683. SIAM, (2021)Dynamic L-Budget Clustering of Curves., , , , , and . SWAT, volume 294 of LIPIcs, page 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Approximating the Fréchet distance when only one curve is c-packed., , and . CoRR, (2024)