{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T10:00:56Z","timestamp":1725703256288},"publisher-location":"ISCA","reference-count":0,"publisher":"ISCA","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.21437\/eurospeech.1997-186","type":"proceedings-article","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T12:12:21Z","timestamp":1659355941000},"page":"1255-1258","source":"Crossref","is-referenced-by-count":1,"title":["Reducing the complexity of the LPC vector quantizer using the k-d tree search algorithm"],"prefix":"10.21437","author":[{"given":"V.","family":"Ramasubramanian","sequence":"first","affiliation":[]},{"given":"Kuldip K.","family":"Paliwal","sequence":"additional","affiliation":[]}],"member":"8866","published-online":{"date-parts":[[1997,9,22]]},"event":{"name":"5th European Conference on Speech Communication and Technology (Eurospeech 1997)","acronym":"eurospeech_1997"},"container-title":["5th European Conference on Speech Communication and Technology (Eurospeech 1997)"],"original-title":[],"deposited":{"date-parts":[[2024,1,16]],"date-time":"2024-01-16T04:27:09Z","timestamp":1705379229000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.isca-archive.org\/eurospeech_1997\/ramasubramanian97_eurospeech.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9,22]]},"references-count":0,"URL":"https:\/\/doi.org\/10.21437\/eurospeech.1997-186","relation":{},"subject":[],"published":{"date-parts":[[1997,9,22]]}}}