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

Teresa M. Jahns

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

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

Theory of computation · 1

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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › source coding › quantization
entropy-constrained quantization
0.011988
New results on optimal entropy-constrained quantization · IEEE Trans. Inf. Theory 1988
Coding theory › source coding
quantization
0.011988
New results on optimal entropy-constrained quantization · IEEE Trans. Inf. Theory 1988
Coding theory
source coding
0.011988
New results on optimal entropy-constrained quantization · IEEE Trans. Inf. Theory 1988
Coding theory › source coding
lossy source coding
0.011988
New results on optimal entropy-constrained quantization · IEEE Trans. Inf. Theory 1988

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

rate-distortion theory · 0.0
YearPublicationVenuePosition
1988 New results on optimal entropy-constrained quantization
abstract
Given h>0, the problem is considered of finding an N-level quantizer Q which is optimal in the sense of encoding a given continuously distributed random variable X with minimum expected squared error, subject to the constraint H(Q(X))>
John C. Kieffer, Teresa M. Jahns, Viktor A. Obuljen
IEEE Trans. Inf. Theory2