메뉴 건너뛰기




Volumn 16, Issue 4, 2002, Pages 357-373

Near best tree approximation

Author keywords

Approximation classes; Compression; Encoding; n term approximation

Indexed keywords


EID: 0036111615     PISSN: 10197168     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1014554317692     Document Type: Article
Times cited : (27)

References (12)
  • 2
    • 0028312573 scopus 로고
    • A signal-dependent time-frequency representation: Fast algorithm for optimal kernel design
    • R. Baraniuk and D. Jones, A signal-dependent time-frequency representation: Fast algorithm for optimal kernel design, IEEE Trans. Signal Processing 45(1) (1994) 134-146.
    • (1994) IEEE Trans. Signal Processing , vol.45 , Issue.1 , pp. 134-146
    • Baraniuk, R.1    Jones, D.2
  • 8
    • 84990575058 scopus 로고
    • Orthonormal bases of compactly supported wavelets
    • I. Daubechies, Orthonormal bases of compactly supported wavelets, Comm. Pure Appl. Math. 41 (1988) 909-996.
    • (1988) Comm. Pure Appl. Math. , vol.41 , pp. 909-996
    • Daubechies, I.1
  • 10
    • 0001220724 scopus 로고
    • Compression of wavelet decompositions
    • R. DeVore, B. Jawerth and V. Popov, Compression of wavelet decompositions, Amer. J. Math. 114 (1992) 737-785.
    • (1992) Amer. J. Math. , vol.114 , pp. 737-785
    • DeVore, R.1    Jawerth, B.2    Popov, V.3
  • 12
    • 0031508912 scopus 로고    scopus 로고
    • CART and best-ortho-basis: A connection
    • D.L. Donoho, CART and best-ortho-basis: A connection, Ann. Statist. 25(5) (1997) 1870-1911.
    • (1997) Ann. Statist. , vol.25 , Issue.5 , pp. 1870-1911
    • Donoho, D.L.1


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