Demo Data from EDBT 2026 / reviewers in the wild / expert
Dennis M. Romain
dblp:52/10570
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1980
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2
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 · 58% Algorithms and data structures · 25% Mathematical optimization · 17% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › numerical linear algebra › eigenvalue computation
eigenvalue approximation |
0.0 | 1 | 1980 | Efficient approximation of a family of noises for application in adaptive spatial processing for signal detection · IEEE Trans. Inf. Theory 1980 |
Information theory › hypothesis testing
signal detection |
0.0 | 1 | 1980 | Efficient approximation of a family of noises for application in adaptive spatial processing for signal detection · IEEE Trans. Inf. Theory 1980 |
Information theory › signal processing
array processing |
0.0 | 1 | 1977 | Optimum detection of Gaussian signal fields in the multipath-anisotropic noise environment and numerical evaluation of detection probabilities · IEEE Trans. Inf. Theory 1977 |
Mathematical optimization
beamforming |
0.0 | 1 | 1977 | Optimum detection of Gaussian signal fields in the multipath-anisotropic noise environment and numerical evaluation of detection probabilities · IEEE Trans. Inf. Theory 1977 |
Information theory
hypothesis testing |
0.0 | 1 | 1977 | Optimum detection of Gaussian signal fields in the multipath-anisotropic noise environment and numerical evaluation of detection probabilities · IEEE Trans. Inf. Theory 1977 |
Methods — techniques the papers use, named apart from their topics
recursive approximation · 0.0karhunen-loeve expansion · 0.0eigenwave decomposition · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1980 | Efficient approximation of a family of noises for application in adaptive spatial processing for signal detectionabstractTwo solutions are presented to the problem of efficiently approximating a family of noises parameterized by a scalar\Upsilon, 0 \leq \Upsilon \leq \infty. The noises are represented in the form of vectors withmrandom components, and their covariance matrices are such that the number of significant eigenvalues increases with\Upsilon. The noise sample vector is to be approximated, within a specified error\epsilon, by a linear combination of vectors taken from a fixed set ofmvectors that are independent of\Upsilon. Furthermore, for each\Upsilonthe number of approximating vectors is to be mlnlmlzed while keeping the error below\epsilon. This number increases with\Upsilonas does the number of significant eigenvalues. The problem is to find a sequence of parameter values\Upsilon{1} < \cdots < \Upsilon_{m},andasetofvectorsu_{1}, \cdots ,u_{m}such that, for eachj, \Upsilon_{j}is the maximum value of\Upsilonfor which the noise can be approximated within the error of\epsilonby using onlyjvectors, andu_{1}, \cdots , u_{j}are the approximatingjvectors corresponding to\Upsilon_{j}The critical constraint is that the set ofmapproximating vectors be independent of\Upsilon. In the first solution, the root-mean-square error is used for the error that is to remain below\epsilon. In the second, the sample error is used but the\epsilon-approximation is limited to only those noise samples which have nonnegligible average power. In both solutions a recursive scheme is given for obtaining\Upsilon_{1}, \cdots , \Upsilon_{m}andu_{1} , \cdots , u_{m}, the resultant\Upsilon-sequence andu-set (orthonormal) are unique. The result is applied to adaptive spatial processing for signal detection in the case where the signal wave, though temporally incoherent, has a known wavefront, the dominant noise ls spatlally localized, and the processor must be nearly opthnum for a wide range of frequencies. Alfons J. Claus, T. T. Kadota, Dennis M. Romain |
IEEE Trans. Inf. Theory | 3 |
| 1977 | Optimum detection of Gaussian signal fields in the multipath-anisotropic noise environment and numerical evaluation of detection probabilitiesabstractThe optimum detector of Gaussian signal fields in the multipath-anisotropic noise environment is derived. The optimum detector consists of a series of matched quadratic filters and a decisionmaker. The filters are spatially and temporally matched to the eigenwaves of the signal-to-noise covariance, and the decisionmaker compares a quadratic form with a preassigned threshold. The optimum detector for single-path signals in isotropic white noise is the well-known delay-and-sum beamformer, which is widely used because of its simple structure. In the case of multipath signals in anisotropic noise, a substantial improvement in detection performance is possible over the beamformer. This is shown by numerically comparing the detection probability of the beamformer with that of the optimum detector for this case. In addition, we numerically evaluate the sensitivity of such an improvement to accurate knowledge of the signal and noise parameters that are required by the optimum detector. We also show the possibility of further improvement by the addition of a vertical segment to the commonly used horizontal linear array to provide sensitivity to the elevation angles of multipath signals. T. T. Kadota, Dennis M. Romain |
IEEE Trans. Inf. Theory | 2 |