{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:31:13Z","timestamp":1725467473828},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637745"},{"type":"electronic","value":"9783540696452"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63774-5_126","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T10:30:57Z","timestamp":1153132257000},"page":"456-463","source":"Crossref","is-referenced-by-count":0,"title":["Optimal trees for searching in codebook"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Kope\u010dek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"33_CR1","unstructured":"M. Berka, I. Kope\u010dek. Optimality of Decision Structures of Information Systems. 16th IFIP Conference on System Modelling and Optimization, 1993, pages 653\u2013657."},{"key":"33_CR2","unstructured":"D.Y. Cheng, A. Gerscho. A Fast Codebook Search Algorithm for Nearest-Neighbour Pattern Matching. Proc ICASSP 86, Tokyo 1986, pages 265\u2013268."},{"key":"33_CR3","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/MASSP.1984.1162229","volume":"1","author":"R.M. Gray","year":"1984","unstructured":"R.M. Gray. Vector Quantization. IEEE ASSP Magazine, 1, 1984, pages 4\u201329.","journal-title":"IEEE ASSP Magazine"},{"key":"33_CR4","unstructured":"I. Kope\u010dek. Speech Synthesis of Czech Language in Time Domain and Applications for Visually Impaired. Proceedings of the 2-nd SQEL Workshop, Plze\u0148 1997, pages 141\u2013144."},{"key":"33_CR5","unstructured":"D. E. Knuth. The Art of Computer Programming. Volume 3-Sorting and Searching. Addison-Wesley, 1973."},{"key":"33_CR6","volume-title":"Graph Theory","author":"W. Mayeda","year":"1972","unstructured":"W. Mayeda. Graph Theory. New York, Wiley 1972."},{"key":"33_CR7","unstructured":"J. Wiedermann. Searching. SNTL, Praha 1991 (in Czech)."},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"T.P. Yunck. A Technique to Identify Nearest Neighbours. IEEE Trans. Syst. 6(76), pages 678\u2013683.","DOI":"10.1109\/TSMC.1976.4309418"}],"container-title":["Lecture Notes in Computer Science","SOFSEM'97: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63774-5_126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T22:05:23Z","timestamp":1555711523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63774-5_126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637745","9783540696452"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-63774-5_126","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}