Demo Data from SIGIR 2026 / reviewers in the wild / expert
D. C. Dowson
dblp:134/4426
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1973
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 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
2 papers |
Information theory · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › probability theory
continuous distributions |
0.0 | 1 | 1973 | Maximum-entropy distributions having prescribed first and second moments (Corresp.) · IEEE Trans. Inf. Theory 1973 |
Information theory › information measures › entropy
entropy minimization |
0.0 | 1 | 1973 | Maximum-entropy distributions having prescribed first and second moments (Corresp.) · IEEE Trans. Inf. Theory 1973 |
Information theory › information measures › entropy
maximum entropy distributions |
0.0 | 1 | 1973 | Maximum-entropy distributions having prescribed first and second moments (Corresp.) · IEEE Trans. Inf. Theory 1973 |
Information theory
moment constraints |
0.0 | 1 | 1973 | Maximum-entropy distributions having prescribed first and second moments (Corresp.) · IEEE Trans. Inf. Theory 1973 |
Information theory › estimation theory
density estimation |
0.0 | 1 | 1970 | Fitting continuous probability density functions over [0,∞) using information theory ideas (Corresp.) · IEEE Trans. Inf. Theory 1970 |
Information theory › information measures › entropy
maximum entropy |
0.0 | 1 | 1970 | Fitting continuous probability density functions over [0,∞) using information theory ideas (Corresp.) · IEEE Trans. Inf. Theory 1970 |
Methods — techniques the papers use, named apart from their topics
lagrange multipliers · 0.0moment matching · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1973 | Maximum-entropy distributions having prescribed first and second moments (Corresp.)abstractThe entropyHof an absolutely continuous distribution with probability density functionp(x)is defined asH = - \int p(x) \log p(x) dx. The formal maximization ofH, subject to the moment constraints\int x^r p(x) dx = \mu_r, r = 0,1,\cdots,m, leads top(x) = \exp (- \sum_{r=0}^m \lamnbda_r x^r), where the\lambda_rhave to be chosen so as to satisfy the moment constraints. Only the casem = 2is considered. It is shown that whenxhas finite range, a distribution maximizing the entropy exists and is unique. When the range is[0,\infty), the maximum-entropy distribution exists if, and only if,\mu_2 \leq 2 \mu_1^2, and a table is given which enables the maximum-entropy distribution to be computed. The case\mu_2 > 2 \mu_1^2is discussed in some detail. D. C. Dowson, A. Wragg |
IEEE Trans. Inf. Theory | 1 |
| 1970 | Fitting continuous probability density functions over [0,∞) using information theory ideas (Corresp.)abstractThe problem of estimating a probability density functionp(x)over[0, \infty)when several low-order moments are known is considered. A computational procedure, based on information theory, is used to obtain the maximum entropy estimates ofp(x)in a number of cases. The situation when the first two moments only are known is considered in some detail. A table is included for estimatingp(x)when given\mu_1 ^{\prime} , \mu_2 ^{\prime}with\mu_2 ^{\prime} \leq 2(\mu_1 ^{\prime}) ^ 2. A. Wragg, D. C. Dowson |
IEEE Trans. Inf. Theory | 2 |