Demo Data from EDBT 2026 / reviewers in the wild / expert
A. Q. Rajput
dblp:36/3538
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1983
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory 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.
| Theoretical computer science
1 paper |
Information theory · 100% |
Topics — the 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › signal processing
signal processing for communications |
0.0 | 1 | 1983 | On evaluating polarity-coincidence correlation when the two inputs are statistically dependent · IEEE Trans. Inf. Theory 1983 |
Methods — techniques the papers use, named apart from their topics
markov process · 0.0hard limiting analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1983 | On evaluating polarity-coincidence correlation when the two inputs are statistically dependentabstractPolarity-coincidence correlation (pcc) is usually analyzed under the assumption of independent noise inputs and small input-signal power. Thus the difficulty of evaluating the variance of the PCC statistic for inputs with arbitrary cross correlations is avoided. An expression for the variance that can be conveniently evaluated on a computer is discussed. As one example, the PCC statistic is analyzed for a strong Markovian signal that is added to two independent, white noise inputs. The effect of hard limiting is determined as a function of the input signal-to-noise ratio. In another example, the PCC detector is analyzed for a small Markovian signal that is added to two dependent Markov noise inputs. In this case, the cost of clipping increases substantially with the noise correlation. A. Q. Rajput, Morton Kanefsky |
IEEE Trans. Inf. Theory | 1 |