activity
20072023
most citedSpatially Transformed Adversarial Examples

241 citations · 861 across the 54 of their papers we have counts for

collaborators
Showing cs.ITShow all

7 papers · 1 filter

cs.IT2015

Optimal Relay Selection with Non-negligible Probing Time

Yang Liu, Yi Ouyang, Mingyan Liu

In this paper an optimal relay selection algorithm with non-negligible probing time is proposed and analyzed for cooperative wireless networks. Relay selection has been introduced…

cs.IT2013★ 1 cited

Sufficient Conditions on the Optimality of Myopic Sensing in Opportunistic Channel Access: A Unifying Framework

Yang Liu, Mingyan Liu, Sahand Haji Ali Ahmad

This paper considers a widely studied stochastic control problem arising from opportunistic spectrum access (OSA) in a multi-channel system, with the goal of providing a unifying a…

cs.IT2010★ 1 cited

Channel Estimation for Opportunistic Spectrum Access: Uniform and Random Sensing

Quanquan Liang, Mingyan Liu

The knowledge of channel statistics can be very helpful in making sound opportunistic spectrum access decisions. It is therefore desirable to be able to efficiently and accurately…

cs.IT2009★ 4 cited

Spectrum Sharing as Network Congestion Games

Sahand Ahmad, Cem Tekin, Mingyan Liu +2

This paper has been withdrawn by the first author due to incomplete bibliography and incorporation of multiple formats in the same file.

cs.IT2009★ 15 cited

Multi-channel Opportunistic Access: A Case of Restless Bandits with Multiple Plays

Sahand Haji Ali Ahmad, Mingyan Liu

This paper considers the following stochastic control problem that arises in opportunistic spectrum access: a system consists of n channels (Gilbert-Elliot channels)where the state…

cs.IT2007★ 1 cited

Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy

Awlok Josan, Mingyan Liu, David L. Neuhoff +1

Franceschetti et al. have recently shown that per-node throughput in an extended, ad hoc wireless network with randomly distributed nodes and multihop routing can be increas…