메뉴 건너뛰기




Volumn , Issue , 2012, Pages 259-268

A GPU approach to subtrajectory clustering using the Fréchet distance

Author keywords

clustering; GPU; GPU programming; movement patterns; parallel programming

Indexed keywords

CLUSTERING; COMPUTATIONAL POWER; GPU; GPU IMPLEMENTATION; GPU PROGRAMMING; MOVEMENT PATTERN; SEQUENTIAL ALGORITHM;

EID: 84872814595     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2424321.2424355     Document Type: Conference Paper
Times cited : (14)

References (22)
  • 1
    • 84872805515 scopus 로고    scopus 로고
    • Computing the discrete fréchet distance in subquadratic time
    • abs/1204.5333
    • P.K. Agarwal, R.B. Avraham, H. Kaplan, and M. Sharir. Computing the discrete fréchet distance in subquadratic time. CoRR, abs/1204.5333, 2012.
    • (2012) CoRR
    • Agarwal, P.K.1    Avraham, R.B.2    Kaplan, H.3    Sharir, M.4
  • 3
    • 0003140383 scopus 로고
    • Computing the fréchet distance between two polygonal curves
    • H. Alt and M. Godau. Computing the fréchet distance between two polygonal curves. Int. J. Comput. Geometry Appl., 5:75-91, 1995.
    • (1995) Int. J. Comput. Geometry Appl. , vol.5 , pp. 75-91
    • Alt, H.1    Godau, M.2
  • 4
    • 21144453588 scopus 로고    scopus 로고
    • Comparison of distance measures for planar curves
    • H. Alt, C. Knauer, and C. Wenk. Comparison of distance measures for planar curves. Algorithmica, 38(1):45-58, 2003.
    • (2003) Algorithmica , vol.38 , Issue.1 , pp. 45-58
    • Alt, H.1    Knauer, C.2    Wenk, C.3
  • 8
    • 33745324689 scopus 로고    scopus 로고
    • Spatio-temporal data reduction with deterministic error bounds
    • H. Cao, O. Wolfson, and G. Trajcevski. Spatio-temporal data reduction with deterministic error bounds. The VLDB Journal, 15(3):211-228, 2006.
    • (2006) The VLDB Journal , vol.15 , Issue.3 , pp. 211-228
    • Cao, H.1    Wolfson, O.2    Trajcevski, G.3
  • 9
  • 10
    • 77954939479 scopus 로고    scopus 로고
    • Approximating the fréchet distance for realistic curves in near linear time
    • A. Driemel, S. Har-Peled, and C. Wenk. Approximating the fréchet distance for realistic curves in near linear time. In Symposium on Computational Geometry, pages 365-374, 2010.
    • (2010) Symposium on Computational Geometry , pp. 365-374
    • Driemel, A.1    Har-Peled, S.2    Wenk, C.3
  • 11
    • 58549099333 scopus 로고    scopus 로고
    • On the Fréchet distance of a set of curves
    • A. Dumitrescu and G. Rote. On the Fréchet distance of a set of curves. In CCCG, pages 162-165, 2004.
    • (2004) CCCG , pp. 162-165
    • Dumitrescu, A.1    Rote, G.2
  • 12
    • 34347382165 scopus 로고    scopus 로고
    • Probabilistic clustering of extratropical cyclones using regression mixture models
    • S. Gaffney, A. Robertson, P. Smyth, S. Camargo, and M. Ghil. Probabilistic clustering of extratropical cyclones using regression mixture models. Climate Dynamic, 29(4):423-440, 2007.
    • (2007) Climate Dynamic , vol.29 , Issue.4 , pp. 423-440
    • Gaffney, S.1    Robertson, A.2    Smyth, P.3    Camargo, S.4    Ghil, M.5
  • 15
    • 85006932978 scopus 로고    scopus 로고
    • Movement analysis
    • W. Kresse and D. M. Danko, editors, chapter 22, Springer
    • J. Gudmundsson, P. Laube, and T. Wolle. Movement analysis. In W. Kresse and D. M. Danko, editors, Handbook of Geographic Information, chapter 22, pages 725-741. Springer, 2012.
    • (2012) Handbook of Geographic Information , pp. 725-741
    • Gudmundsson, J.1    Laube, P.2    Wolle, T.3
  • 16
    • 34547398522 scopus 로고    scopus 로고
    • Computing longest duration flocks in trajectory data
    • Rolf A. de By and Silvia Nittel, editors, ACM
    • J. Gudmundsson and M.J. van Kreveld. Computing longest duration flocks in trajectory data. In Rolf A. de By and Silvia Nittel, editors, GIS, pages 35-42. ACM, 2006.
    • (2006) GIS , pp. 35-42
    • Gudmundsson, J.1    Van Kreveld, M.J.2
  • 19
    • 37849187329 scopus 로고    scopus 로고
    • Time-focused clustering of trajectories of moving objects
    • M. Nanni and D. Pedreschi. Time-focused clustering of trajectories of moving objects. J. Intell. Inf. Syst., 27(3):267-289, 2006.
    • (2006) J. Intell. Inf. Syst. , vol.27 , Issue.3 , pp. 267-289
    • Nanni, M.1    Pedreschi, D.2
  • 20
    • 84872827071 scopus 로고    scopus 로고
    • Technical report, Nvidia Corporation
    • CUDA Programing Guide 4.1. Technical report, Nvidia Corporation, 2011.
    • (2011) CUDA Programing Guide 4.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.