4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.IT2013
Routing for Security in Networks with Adversarial Nodes
Pak Hou Che, Minghua Chen, Tracey Ho +2
We consider the problem of secure unicast transmission between two nodes in a directed graph, where an adversary eavesdrops/jams a subset of nodes. This adversarial setting is in c…
cs.IT2011★ 4 cited
Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms
Chun Lam Chan, Pak Hou Che, Sidharth Jaggi +1
We consider the problem of detecting a small subset of defective items from a large set via non-adaptive "random pooling" group tests. We consider both the case when the measuremen…