VLDB 2026 Research / reviewers in the wild / expert
Viswanath Annampedu
dblp:90/2857
· DBLP profile ↗
4ranked-venue papers
2as first author
0since 2021 · last 2013
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2Theory of computation · 2 · 2 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
2 papers |
Computational complexity · 68% Coding theory · 20% Information theory · 11% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity › circuit complexity
threshold functions |
0.2 | 1 | 2013 | Decomposition of threshold functions into bounded fan-in threshold functions · Inf. Comput. 2013 |
Coding theory
boolean functions |
0.0 | 1 | 2013 | Decomposition of threshold functions into bounded fan-in threshold functions · Inf. Comput. 2013 |
Information theory
hypothesis testing |
0.0 | 1 | 2000 | Two rank order tests for M-ary detection · IEEE Trans. Inf. Theory 2000 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0likelihood ratio test · 0.0asymptotic analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Decomposition of threshold functions into bounded fan-in threshold functions
Viswanath Annampedu, Meghanad D. Wagh |
Inf. Comput. | 1 |
| 2000 | Two rank order tests for M-ary detectionabstractWe consider a general M-ary detection problem where, given M groups of L samples each, the problem is to identify which unique group of L samples have come from the signal hypothesis. The optimal likelihood ratio test is unrealizable, when the joint distribution of M L samples is not completely known. We consider two rank order types of tests termed the modified rank test (MRT) and the modified rank test with row sort (MRTRS). We examine through simulation, the small sample probability of error performances of MRT and MRTRS for detecting a signal among contaminants. Numerically comparable closed-form error expressions are derived for some special cases. The asymptotic (large sample) error rate of the MRT is also derived. The results indicate that MRTRS provides improved performance over other previously known rank tests. Viswanath Annampedu, Vladimir V. Roganov, R. Viswanathan 0002 |
IEEE Trans. Inf. Theory | 1 |
| 1999 | A rate 16/17 punctured MTR block codeabstractThis paper presents a rate 16/17 "punctured" time varying maximum transition run (PMTR) block code. It is not possible to achieve a rate 16/17 or higher TMTR block code which completely suppresses the minimum distance error event. However, it is in general, possible to make a tradeoff between obtaining higher code rates and coding gain by puncturing; the space of codewords and limiting the extent to which the minimum distance error event is suppressed. As an example, we obtain a rate 16/17 block code where the minimum distance error event is supported in only 6 out of the 17 possible codeword locations. An implementation of the code is presented and simulation results examining the performance benefits under different conditions are also presented. Pervez M. Aziz, Necip Sayiner, Viswanath Annampedu |
ICC | 3 |
| 1998 | Diversity combining in antenna array base station receiver for DS/CDMA systemabstractThis paper analyses a few schemes for combining base station antenna array signals in wireless DS/CDMA. The performances of equal gain combining (EGC), likelihood rank test (LRT) and a modified rank test (MRT) are evaluated using simulation studies. The results indicate that, under certain assumptions on the multiple access interference statistics, the probability of error of the MRT is lower than that of EGC, if a few high power interfering users are present along with a low power user of interest. If there are a moderately large number of users and if the received power of all the users are nearly the same, then EGC outperforms the MRT. In fact, under this condition, the performance of EGC is close to that of the optimal likelihood ratio test. C. H. Gowda, Viswanath Annampedu, R. Viswanathan 0002 |
ICC | 2 |