Demo Data from EDBT 2026 / reviewers in the wild / expert
Darrell R. Gimlin
dblp:122/1479
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 1993
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-authorTheory of computation · 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 networks
1 paper |
Physical-layer communications · 100% | |
| Artificial intelligence
1 paper |
Learning paradigms · 87% Probabilistic and Bayesian machine learning · 13% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications › modulation
multicarrier modulation |
0.0 | 1 | 1993 | On minimizing the peak-to-average power ratio for the sum of N sinusoids · IEEE Trans. Commun. 1993 |
Physical-layer communications › modulation › multicarrier modulation › OFDM
peak-to-average power ratio |
0.0 | 1 | 1993 | On minimizing the peak-to-average power ratio for the sum of N sinusoids · IEEE Trans. Commun. 1993 |
Physical-layer communications
signal design |
0.0 | 1 | 1993 | On minimizing the peak-to-average power ratio for the sum of N sinusoids · IEEE Trans. Commun. 1993 |
Machine learning › Learning paradigms
partially supervised learning |
0.0 | 1 | 1974 | A parametric procedure for imperfectly supervised learning with unknown class probabilities (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Machine learning › Learning paradigms
unsupervised learning |
0.0 | 1 | 1974 | A parametric procedure for imperfectly supervised learning with unknown class probabilities (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › density estimation
mixture density estimation |
0.0 | 1 | 1974 | A parametric procedure for imperfectly supervised learning with unknown class probabilities (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Methods — techniques the papers use, named apart from their topics
phase optimization · 0.0probabilistic labeling · 0.0parametric estimation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | On minimizing the peak-to-average power ratio for the sum of N sinusoidsabstractA new derivation is presented of a previously known relationship for phasing N equal-amplitude, equally spaced (in frequency) sinusoids so that the peak-to-average power ratio of their sum is 2.6 dB. The method of derivation provides intuitive insight into why this result is possible, and shows that the 2.6 dB figure is obtained independently of N as long as N is large. Any phase or frequency modulation can be applied simultaneously to all N sinusoids without altering this result.> Darrell R. Gimlin, Charles R. Patisaul |
IEEE Trans. Commun. | 1 |
| 1974 | A parametric procedure for imperfectly supervised learning with unknown class probabilities (Corresp.)abstractA computationally feasible parametric procedure for unsupervised learning has been given by Agrawala [1]. The procedure eliminates the computational difficulties associated with updating using a mixture density by making use of a probabilistic labeling scheme. Shanmugam [2] has given a similar parametric procedure using probabilistic labeling for the more general problem of imperfectly supervised learning. Both procedures assume known class probabilities. In this correspondence a computationally feasible parametric procedure using probabilistic labeling is given for imperfectly supervised learning when the class probabilities are among the unknown statistical parameters. Darrell R. Gimlin |
IEEE Trans. Inf. Theory | 1 |
| 1974 | A κ - κ Error Correcting Procedure for Nonparametric Imperfectly Supervsed LearningabstractA decision-directed error correcting scheme for non-paramnetric imperfectly supervised learning is proposed. The proposed procedure is based on a nearest neighbor rule with a reject option and combines the knowledge accumulated by the learning scheme with that provided by the supervision. An asymptotic analysis of the error correction scheme shows that relabeling of training measurements can have a lower probability of error than the supervision provided Bayes' probability of error is less thani the supervisions probability of error. Computer simulations are used to compare the performance of the proposed scheme with the performance of the k nearest neighbor rule without error correction. Darrell R. Gimlin, D. R. Ferrell |
IEEE Trans. Syst. Man Cybern. | 1 |