메뉴 건너뛰기




Volumn 2906, Issue , 2003, Pages 6-15

Linear time algorithm for approximating a curve by a single-peaked curve

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; PIECEWISE LINEAR TECHNIQUES;

EID: 33645215744     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_3     Document Type: Article
Times cited : (6)

References (9)
  • 1
    • 84938080619 scopus 로고    scopus 로고
    • Near Linear Time Approximation Algorithms for Curve Simplification in Two and Three Dimensions
    • Proc. 10th European Symp. on Algorithms
    • P. Agarwal, S. Hal-Peled, N. Mustafa, Y. Wang, Near Linear Time Approximation Algorithms for Curve Simplification in Two and Three Dimensions, Proc. 10th European Symp. on Algorithms, Springer LNCS 2461 (2002) pp. 29-41.
    • (2002) Springer LNCS , vol.2461 , pp. 29-41
    • Agarwal, P.1    Hal-Peled, S.2    Mustafa, N.3    Wang, Y.4
  • 7
    • 0001276108 scopus 로고    scopus 로고
    • Implementation and Evaluation of Decision Trees with Range and Region Splitting
    • Y. Morimoto, T. Fukuda, S. Morishita, and T. Tokuyama, Implementation and Evaluation of Decision Trees with Range and Region Splitting, Constraints (1997) 402-427.
    • (1997) Constraints , pp. 402-427
    • Morimoto, Y.1    Fukuda, T.2    Morishita, S.3    Tokuyama, T.4


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