On the public citation graph
Explicit solutions for some simple decentralized detection problems
0 signed · 61 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-46092-0openalex-snapshot
The Theory of Max-Min and its Application to Weapons Allocation Problems
inferredcites →https://doi.org/10.1007/978-94-009-3929-5_3openalex-snapshot
A Distributed Hypothesis-Testing Team Decision Problem with Communications Cost
inferredcites →https://doi.org/10.1007/bf02551407openalex-snapshot
Decentralized detection by a large number of sensors
inferredcites →https://doi.org/10.1016/0165-1684(86)90074-5openalex-snapshot
A theory of distributed detection
inferredcites →https://doi.org/10.1016/s0019-9958(67)90052-6openalex-snapshot
Lower bounds to error probability for coding on discrete memoryless channels. I
inferredcites →https://doi.org/10.1016/s0019-9958(67)91200-4openalex-snapshot
Lower bounds to error probability for coding on discrete memoryless channels. II
inferredcites →https://doi.org/10.1049/ip-f-1.1986.0010openalex-snapshot
Distributed radar detection theory
inferredcites →https://doi.org/10.1109/cdc.1986.267211openalex-snapshot
A distributed hypothesis-testing team decision problem with communications cost
inferredcites →https://doi.org/10.1109/cdc.1986.267214openalex-snapshot
Neyman-Pearson detection wirh distributed sensors
inferredcites →https://doi.org/10.1109/tac.1982.1103071openalex-snapshot
A simulation study of a decentralized detection problem
inferredcites →https://doi.org/10.1109/tac.1984.1103601openalex-snapshot
The decentralized quickest detection problem
inferredcites →https://doi.org/10.1109/tac.1985.1103988openalex-snapshot
On the complexity of decentralized decision making and detection problems
inferredcites →https://doi.org/10.1109/taes.1981.309178openalex-snapshot
Detection with Distributed Sensors
inferredcites →https://doi.org/10.1109/taes.1986.310699openalex-snapshot
Optimal Data Fusion in Multiple Sensor Detection Systems
inferredcites →https://doi.org/10.1109/taes.1986.310747openalex-snapshot
Hypotheses Testing in a Distributed Environment
inferredcites →https://doi.org/10.1109/taes.1987.310858openalex-snapshot
Optimal Decision Fusion in Multiple Sensor Systems
inferredcites →https://doi.org/10.1109/taes.1987.310915openalex-snapshot
Design and Performance Comparison of Distributed Detection Networks
inferredcites →https://doi.org/10.1109/taes.1987.313355openalex-snapshot
Optimal Detection and Performance of Distributed Sensor Systems
inferredcites →https://doi.org/10.12681/eadd/3778openalex-snapshot
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
inferredcites →https://doi.org/10.21236/ada201715openalex-snapshot
Explicit Solutions for Some Simple Decentralized Detection Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-0-387-68845-9_3openalex-snapshot
Error Exponents for Decentralized Detection in Tree Networks
inferred← citeshttps://doi.org/10.1007/978-1-4615-1045-1_7openalex-snapshot
Multisensor Interval Estimation Fusion
inferred← citeshttps://doi.org/10.1109/21.120065openalex-snapshot
Decision fusion strategies in multisensor environments
inferred← citeshttps://doi.org/10.1109/7.395226openalex-snapshot
Optimal m-ary data fusion with distributed sensors
inferred← citeshttps://doi.org/10.1109/7.913674openalex-snapshot
Mutual and conditional mutual informations for optimizing distributed Bayes detectors
inferred← citeshttps://doi.org/10.1109/9.148368openalex-snapshot
A distributed M-ary hypothesis testing problem with correlated observations
inferred← citeshttps://doi.org/10.1109/acssc.2011.6190347openalex-snapshot
Error probability bounds for binary relay trees with unreliable communication links
inferred← citeshttps://doi.org/10.1109/allerton.2012.6483469openalex-snapshot
Rate of learning in hierarchical social networks
inferred← citeshttps://doi.org/10.1109/cdc.1989.70177openalex-snapshot
A distributed M-ary hypothesis testing problem with correlated observations
inferred← citeshttps://doi.org/10.1109/cdc.2011.6160648openalex-snapshot
Error probability bounds for balanced binary relay trees
inferred← citeshttps://doi.org/10.1109/cdc.2012.6427057openalex-snapshot
Submodularity and optimality of fusion rules in balanced binary relay trees
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798379openalex-snapshot
Decentralized observability with limited communication between sensors
inferred← citeshttps://doi.org/10.1109/dcc.2007.16openalex-snapshot
Bayesian Detection in Bounded Height Tree Networks
inferred← citeshttps://doi.org/10.1109/icassp.1991.150657openalex-snapshot
A new approach of decentralized detection
inferred← citeshttps://doi.org/10.1109/icc.2010.5502167openalex-snapshot
Distributed Detection of Local Phenomena with Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icosp.2000.893382openalex-snapshot
An optimum data fusion algorithm for distributed detection system
inferred← citeshttps://doi.org/10.1109/icosp.2004.1442167openalex-snapshot
Multisensor distributed detection fusion based on wavelet domain filter
inferred← citeshttps://doi.org/10.1109/icr.2001.984814openalex-snapshot
Optimal distributed decision fusion in the sense of the Neyman-Pearson test
inferred← citeshttps://doi.org/10.1109/icsmc.1989.71386openalex-snapshot
A model of distributed team information processing under ambiguity
inferred← citeshttps://doi.org/10.1109/icsmc.1989.71431openalex-snapshot
An algorithm for determining the decision thresholds in a distributed detection problem
inferred← citeshttps://doi.org/10.1109/icsmc.1990.142138openalex-snapshot
Optimization of detection networks. I. Tandem structures
inferred← citeshttps://doi.org/10.1109/iswpc.2011.5751320openalex-snapshot
The value of feedback for decentralized detection in large sensor networks
inferred← citeshttps://doi.org/10.1109/jstsp.2013.2245859openalex-snapshot
Learning in Hierarchical Social Networks
inferred← citeshttps://doi.org/10.1109/robot.1999.770415openalex-snapshot
Multiple hypothesis testing method for decision making
inferred← citeshttps://doi.org/10.1109/tcns.2016.2562507openalex-snapshot
Near-Optimal Distributed Detection in Balanced Binary Relay Trees
inferred← citeshttps://doi.org/10.1109/tit.2008.928240openalex-snapshot
Data Fusion Trees for Detection: Does Architecture Matter?
inferred← citeshttps://doi.org/10.1109/tit.2012.2187323openalex-snapshot
Error Probability Bounds for Balanced Binary Relay Trees
inferred← citeshttps://doi.org/10.1109/tit.2012.2211331openalex-snapshot
The Value of Feedback in Decentralized Detection
inferred← citeshttps://doi.org/10.1109/tsp.2007.914343openalex-snapshot
On the Impact of Node Failures and Unreliable Communications in Dense Sensor Networks
inferred← citeshttps://doi.org/10.1109/tsp.2009.2023374openalex-snapshot
Bayesian Detection in Bounded Height Tree Networks
inferred← citeshttps://doi.org/10.1109/tsp.2013.2246156openalex-snapshot
Detection Performance in Balanced Binary Relay Trees With Node and Link Failures
inferred← citeshttps://doi.org/10.1109/vetecs.2012.6240183openalex-snapshot
Frequency-Hopping/M-Ary Frequency-Shift Keying Wireless Sensor Network Monitoring Multiple Source Events
inferred← citeshttps://doi.org/10.1109/wcsp.2018.8555894openalex-snapshot
Reliability Measurement Based Transmission Scheme for Wireless Sensor Network
inferred← citeshttps://doi.org/10.1117/12.603624openalex-snapshot
Sensor fusion for coastal waters surveillance
inferred← citeshttps://doi.org/10.1117/12.603745openalex-snapshot
Design considerations for sensor networks with gateways
inferred← citeshttps://doi.org/10.13140/rg.2.2.13219.86565openalex-snapshot
Decentralized Hypothesis Testing in Sensor Networks
inferred← citeshttps://doi.org/10.21236/ada584390openalex-snapshot
Information Fusion and Control in Hierarchical Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1105.1187openalex-snapshot
Error Probability Bounds for Balanced Binary Relay Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1106.0061openalex-snapshot
Error Probability Bounds for Binary Relay Trees with Crummy Sensors
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.