Finding long and similar parts of trajectories (Q654283): Difference between revisions

@@ Property / cites work @@
+Efficiently approximating polygonal paths in three and higher dimensions
+Normal rank
@@ Property / cites work @@
+Q3602889
@@ Property / cites work: Q3602889 / rank @@
+Normal rank
@@ Property / cites work @@
+DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES
+Normal rank
@@ Property / cites work @@
+Q4633876
@@ Property / cites work: Q4633876 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for the Maximum-Density Segment Problem
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
+Normal rank
@@ Property / cites work @@
+Compressing Spatio-temporal Trajectories
@@ Property / cites work: Compressing Spatio-temporal Trajectories / rank @@
+Normal rank
@@ Property / cites work @@
+Q4401011
@@ Property / cites work: Q4401011 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
+Normal rank
@@ Property / cites work @@
+Q4414408
@@ Property / cites work: Q4414408 / rank @@
+Normal rank