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

G. Vasquez

dblp:172/3443 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1986
—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.

Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › source coding › quantization › optimal quantization
mean-squared-error quantization
0.011986
Comments on "A Simple Approximation for Minimum Mean-Square Error Symmetric Uniform Quantization" · IEEE Trans. Commun. 1986
Coding theory › source coding
quantization
0.011986
Comments on "A Simple Approximation for Minimum Mean-Square Error Symmetric Uniform Quantization" · IEEE Trans. Commun. 1986
Coding theory › source coding › quantization › scalar quantization
uniform quantizer
0.011986
Comments on "A Simple Approximation for Minimum Mean-Square Error Symmetric Uniform Quantization" · IEEE Trans. Commun. 1986

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

mean-square error optimization · 0.0
YearPublicationVenuePosition
1986 Comments on "A Simple Approximation for Minimum Mean-Square Error Symmetric Uniform Quantization"
abstract
In the paper referred to in the title, a design procedure for symmetric scalar uniform quantizers based on the minimum mean-square error criterion has been proposed. In this correspondence an alternative procedure for the same optimization problem is reproduced from a previously published paper and the two procedures are compared, pointing out some complementary features.
G. Vasquez
IEEE Trans. Commun.1