Demo Data from SIGIR 2026 / reviewers in the wild / expert
D. I. Lekhovitsky
dblp:324/3516
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1989
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 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 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › estimation theory
autoregressive model fitting |
0.0 | 1 | 1989 | Comments, with reply, on 'On a property of the PARCOR coefficients of stationary processes having Gaussian-shaped ACF' (G. Jacovitti and G. Scarano) · Proc. IEEE 1989 |
Information theory
signal processing |
0.0 | 1 | 1989 | Comments, with reply, on 'On a property of the PARCOR coefficients of stationary processes having Gaussian-shaped ACF' (G. Jacovitti and G. Scarano) · Proc. IEEE 1989 |
Methods — techniques the papers use, named apart from their topics
recursive proof · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1989 | Comments, with reply, on 'On a property of the PARCOR coefficients of stationary processes having Gaussian-shaped ACF' (G. Jacovitti and G. Scarano)abstractIt is pointed out that the proof given in the original paper (ibid, vol.75, no.7, p.960-1, 1987) for eq. (2) for the PARCOR coefficients K/sub i/ is too complicated. A simpler proof is given. The author replies by calling attention to the essential recursive aspects of the problem, shown by the original proof.> D. I. Lekhovitsky |
Proc. IEEE | 1 |