Joy A. Thomas

dblp:94/1920 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 1995
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 2 first-authorComputer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 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.

Computer networks
1 paper
Network performance modeling · 72% Internet architecture and protocols · 9% Network optimization and economics · 9%
Theoretical computer science
2 papers
Information theory · 97% Coding theory · 3%

Topics — the 14 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network performance modeling › quality-of-service guarantees
effective bandwidth
0.011995
Effective Bandwith in High-Speed Digital Networks · IEEE J. Sel. Areas Commun. 1995
Network performance modeling
large deviations
0.011995
Effective Bandwith in High-Speed Digital Networks · IEEE J. Sel. Areas Commun. 1995
Information theory › information measures › entropy › entropy inequalities
entropy power inequality
0.011991
Information theoretic inequalities · IEEE Trans. Inf. Theory 1991
Information theory › information measures
fisher information
0.011991
Information theoretic inequalities · IEEE Trans. Inf. Theory 1991
Information theory › information measures
information inequalities
0.011991
Information theoretic inequalities · IEEE Trans. Inf. Theory 1991
Information theory
channel capacity
0.011987
Feedback can at most double Gaussian multiple access channel capacity · IEEE Trans. Inf. Theory 1987
Information theory › channel capacity
feedback capacity
0.011987
Feedback can at most double Gaussian multiple access channel capacity · IEEE Trans. Inf. Theory 1987
Information theory › network information theory › multiple-access channel
gaussian multiple-access channel
0.011987
Feedback can at most double Gaussian multiple access channel capacity · IEEE Trans. Inf. Theory 1987
Information theory › network information theory
multiple-access channel
0.011987
Feedback can at most double Gaussian multiple access channel capacity · IEEE Trans. Inf. Theory 1987
Internet architecture and protocols
ATM networks
0.011995
Effective Bandwith in High-Speed Digital Networks · IEEE J. Sel. Areas Commun. 1995
Network optimization and economics › resource allocation
bandwidth allocation
0.011995
Effective Bandwith in High-Speed Digital Networks · IEEE J. Sel. Areas Commun. 1995
Network performance modeling
queueing analysis
0.011995
Effective Bandwith in High-Speed Digital Networks · IEEE J. Sel. Areas Commun. 1995
Network measurement and analytics › traffic characterization
traffic descriptor
0.011995
Effective Bandwith in High-Speed Digital Networks · IEEE J. Sel. Areas Commun. 1995
Coding theory › channel coding
strong converse
0.011987
Feedback can at most double Gaussian multiple access channel capacity · IEEE Trans. Inf. Theory 1987

Methods — techniques the papers use, named apart from their topics

large deviation theory · 0.0laplace method of integration · 0.0uncertainty principle · 0.0determinant inequalities · 0.0brunn-minkowski inequality · 0.0covariance matrix bounds · 0.0
YearPublicationVenuePosition
1995 Effective Bandwith in High-Speed Digital Networks
abstract
The theory of large deviations provides a simple unified basis for statistical mechanics, information theory and queueing theory. The objective of this paper is to use large deviation theory and the Laplace method of integration to provide an simple intuitive overview of the theory of effective bandwidth for high-speed digital networks, especially ATM networks. This includes (1) identification of the appropriate energy function, entropy function and effective bandwidth function of a source, (2) the calculus of the effective bandwidth functions, (3) bandwidth allocation and buffer management, (4) traffic descriptors, and (5) envelope processes and conjugate processes for fast simulation and bounds.>
Cheng-Shang Chang, Joy A. Thomas
IEEE J. Sel. Areas Commun.2
1995 Review of 'Managing Gigabytes: Compressing and Indexing Documents and Images' (Witten, I.H., et al.; 1994)
Joy A. Thomas
IEEE Trans. Inf. Theory1
1991 Information theoretic inequalities
abstract
The role of inequalities in information theory is reviewed, and the relationship of these inequalities to inequalities in other branches of mathematics is developed. The simple inequalities for differential entropy are applied to the standard multivariate normal to furnish new and simpler proofs of the major determinant inequalities in classical mathematics. The authors discuss differential entropy inequalities for random subsets of samples. These inequalities when specialized to multivariate normal variables provide the determinant inequalities that are presented. The authors focus on the entropy power inequality (including the related Brunn-Minkowski, Young's, and Fisher information inequalities) and address various uncertainty principles and their interrelations.>
Amir Dembo, Thomas M. Cover, Joy A. Thomas
IEEE Trans. Inf. Theory3
1987 Feedback can at most double Gaussian multiple access channel capacity
abstract
The converse for the discrete memoryless multiple access channel is generalized and is used to derive strong bounds on the total capacity (sum of the rates of all the senders) of anm-user Gaussian multiple access channel in terms of the input covariance matrix. These bounds are used to show that the total capacity of the channel with feedback is less than twice the total capacity without feedback. The converse for the general multiple access channel is also used to show that for anym-user multiple access channel, feedback cannot increase the total capacity by more than a factor ofm.
Joy A. Thomas
IEEE Trans. Inf. Theory1
1985 Processing of noisy speech using group delay functions
abstract
A new noniterative technique for all pole modelling of noisy speech is proposed. We exploit the additive and high resolution properties of a group delay function to identify the high signal to noise ratio (SNR) regions of the short time spectrum and to separate out these regions from the low SNR regions. A modified spectrum is derived from the group delay function in these regions. The new spectrum is used to derive the all pole model for the speech segment. The main advantage of this method is that it is not necessary to have prior knowledge of the noise or speech characteristics as in the other methods of processing noisy speech.
Joy A. Thomas, Bayya Yegnanarayana, Raghuram Karinthi, V. Venkateswar
ICASSP1