Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Imad Y. Hoballah

dblp:89/5776 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1989
—ORCID · none

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

Theory 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
Information theory · 100%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › statistical inference › distributed inference
distributed detection
0.021989
Distributed Bayesian signal detection · IEEE Trans. Inf. Theory 1989
An information theoretic approach to the distributed detection problem · IEEE Trans. Inf. Theory 1989
Information theory › information measures › entropy
entropy minimization
0.011989
An information theoretic approach to the distributed detection problem · IEEE Trans. Inf. Theory 1989
Distributed systems › distributed machine learning › distributed inference
distributed detection
0.021989
Distributed Bayesian signal detection · IEEE Trans. Inf. Theory 1989
An information theoretic approach to the distributed detection problem · IEEE Trans. Inf. Theory 1989

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

person-by-person optimization · 0.0information-theoretic cost function · 0.0bayesian formulation · 0.0
YearPublicationVenuePosition
1989 An information theoretic approach to the distributed detection problem
abstract
The distributed detection problem is considered from an information-theoretic point of view. An entropy-based cost function is used for system optimization. This cost function maximizes the amount of information transfer between the input and the output. Distributed detection system topologies with and without a fusion center are considered, and an optimal fusion rule and optimal decision rules are derived.>
Imad Y. Hoballah, Pramod K. Varshney
IEEE Trans. Inf. Theory1
1989 Distributed Bayesian signal detection
abstract
The signal detection problem is considered for the case in which distributed sensors are used and a global decision is desired. Local decisions from the sensors are fed to a data fusion center, which yields a global decision based on a fusion rule. A Bayesian formulation of the problem is considered, and a person-by-person optimization of the overall system is carried out. The special case of identical detectors with independent observations is considered as well. An illustrative example is presented.>
Imad Y. Hoballah, Pramod K. Varshney
IEEE Trans. Inf. Theory1