Demo Data from EDBT 2026 / reviewers in the wild / expert
Hardish Singh
dblp:53/862
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1988
—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 · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory
hypothesis testing |
0.0 | 1 | 1988 | A generalized two-threshold detection procedure · IEEE Trans. Inf. Theory 1988 |
Information theory › hypothesis testing
multihypothesis testing |
0.0 | 1 | 1988 | A generalized two-threshold detection procedure · IEEE Trans. Inf. Theory 1988 |
Information theory › statistical inference › sequential analysis
sequential detection |
0.0 | 1 | 1988 | A generalized two-threshold detection procedure · IEEE Trans. Inf. Theory 1988 |
Methods — techniques the papers use, named apart from their topics
sequential analysis · 0.0optimization algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1988 | A generalized two-threshold detection procedureabstractA modified sequential procedure for testing binary hypotheses with different means, proposed by C.C. Lee and J.B. Thomas (ibid., vol.IT-30, no.1, p.16-23, Jan. 1984), is generalized for application to the case of multiple hypotheses with different means/variances of the Gaussian distribution. The method constitutes a two-threshold test for fixed-size packages of samples with a sequential procedure of discarding the package for which no decision is reached and subsequently testing a new package. The objective is to find an optimum package size N/sub 0/ which leads to the minimum overall average sample number (ASN) for a given overall error probability. An optimization algorithm is developed to extend the application of the Lee-Thomas procedure to the M-ary case. Performance characteristics of the generalized two-threshold (GTT) test procedure are compared with those of conventional sequential as well as fixed-sample-size (FSS) methods. It is shown for the M-ary different means/variances cases that for low error rates the number of samples required by the GTT test is, on the average, approximately half that needed by a FSS test. However, it is somewhat more than the ASN obtained with a conventional sequential test. With decreasing error probabilities the GTT test performance approaches that of conventional sequential methods.> Solomon M. Fleisher, Hardish Singh, Edward Shwedyk |
IEEE Trans. Inf. Theory | 2 |