• DocumentCode
    2603847
  • Title

    Boundedness and Consistency of Greedy Growing for Tree-Structured Vector Quantizes

  • Author

    Nobel, Andrew B. ; Olshen, Richard A.

  • Author_Institution
    University of Illinois
  • fYear
    1993
  • fDate
    17-22 Jan 1993
  • Firstpage
    334
  • Lastpage
    334
  • Keywords
    Algorithm design and analysis; Binary trees; Density measurement; Design methodology; Greedy algorithms; Partitioning algorithms; Random variables; Rate-distortion;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1993. Proceedings. 1993 IEEE International Symposium on
  • Print_ISBN
    0-7803-0878-6
  • Type

    conf

  • DOI
    10.1109/ISIT.1993.748650
  • Filename
    748650
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2603847