Demo Data from SIGIR 2026 / reviewers in the wild / expert
C. R. Dietrich
dblp:53/5497
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1994
—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 |
Information theory · 50% Algorithms and data structures · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory
signal processing |
0.0 | 1 | 1994 | Bounds on the size of nonnegative definite circulant embeddings of positive definite Toeplitz matrices · IEEE Trans. Inf. Theory 1994 |
Algorithms and data structures › numerical linear algebra › structured matrices
toeplitz matrix |
0.0 | 1 | 1994 | Bounds on the size of nonnegative definite circulant embeddings of positive definite Toeplitz matrices · IEEE Trans. Inf. Theory 1994 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | Bounds on the size of nonnegative definite circulant embeddings of positive definite Toeplitz matricesabstractDembo et al. (see ibid., vol. 35, pp. 1206-1212, 1989) showed that an N/spl times/N positive definite Toeplitz matrix T could be embedded in a 2M/spl times/2M nonnegative definite circulant matrix S with M=O[/spl kappa/(T)N/sup 2/]. This paper shows that the size of the embedding can be reduced to M=O[/spl kappa/(T)/sup 1/2/N/sup 5/4/] and that this is best possible for the technique presented by Dembo et al.> Garry N. Newsam, C. R. Dietrich |
IEEE Trans. Inf. Theory | 2 |