33 citations · 116 across the 18 of their papers we have counts for
7 papers · 1 filter
Subspace selection for projection maximization with matroid constraints
Zhenliang Zhang, Yuan Wang, Edwin K. P. Chong +2
Suppose that there is a ground set which consists of a large number of vectors in a Hilbert space. Consider the problem of selecting a subset of the ground set such that the projec…
Submodularity and Optimality of Fusion Rules in Balanced Binary Relay Trees
Zhenliang Zhang, Edwin K. P. Chong, Ali Pezeshki +2
We study the distributed detection problem in a balanced binary relay tree, where the leaves of the tree are sensors generating binary messages. The root of the tree is a fusion ce…
Detection Performance in Balanced Binary Relay Trees with Node and Link Failures
Zhenliang Zhang, Edwin K. P. Chong, Ali Pezeshki +2
We study the distributed detection problem in the context of a balanced binary relay tree, where the leaves of the tree correspond to identical and independent sensors generati…
Detection Performance of M-ary Relay Trees with Non-binary Message Alphabets
Zhenliang Zhang, Edwin K. P. Chong, Ali Pezeshki +2
We study the detection performance of -ary relay trees, where only the leaves of the tree represent sensors making measurements. The root of the tree represents the fusion cente…
Error Probability Bounds for M-ary Relay Trees
Zhenliang Zhang, Edwin K. P. Chong, Ali Pezeshki +2
We study the detection error probabilities associated with an M-ary relay tree, where the leaves of the tree correspond to identical and independent sensors. Only these leaves are…
Error Probability Bounds for Binary Relay Trees with Crummy Sensors
Zhenliang Zhang, Ali Pezeshki, William Moran +2
We study the detection error probability associated with balanced binary relay trees, in which sensor nodes fail with some probability. We consider N identical and independent crum…