Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

J. I. Lee

dblp:123/8778 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1990
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Audio and music processing · 70% Image and video coding · 30%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video coding › quantization › vector quantization
codebook search		 0.011990
On reducing computational complexity of codebook search in CELP coding · IEEE Trans. Commun. 1990
Audio and music processing › speech coding
code-excited linear prediction		 0.011990
On reducing computational complexity of codebook search in CELP coding · IEEE Trans. Commun. 1990
Audio and music processing
speech coding		 0.011990
On reducing computational complexity of codebook search in CELP coding · IEEE Trans. Commun. 1990
Audio and music processing
linear prediction		 0.011990
On reducing computational complexity of codebook search in CELP coding · IEEE Trans. Commun. 1990

Methods — techniques the papers use, named apart from their topics

frequency-domain search · 0.0code vector sparsity · 0.0
YearPublicationVenuePosition
1990 On reducing computational complexity of codebook search in CELP coding
abstract
A computationally efficient codebook search method in code-excited linear prediction is proposed. The method can reduce the computational complexity by almost one half compared to the frequency-domain codebook search method that is currently regarded as the fastest search method, while giving almost the same quality of speech. This reduction is possible as a result of the simultaneous use of frequency-domain search and code vector sparsity.>
J. I. Lee, Chong Kwan Un
 IEEE Trans. Commun.1