4 citations · 4 across the 11 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2021
Fast Graph Subset Selection Based on G-optimal Design
Zhengpin Li, Zheng Wei, Jian Wang +2
Graph sampling theory extends the traditional sampling theory to graphs with topological structures. As a key part of the graph sampling theory, subset selection chooses nodes on g…
cs.IT2021
Energy-Efficient Ultra-Dense Network with Deep Reinforcement Learning
Hyungyu Ju, Seungnyun Kim, Youngjoon Kim +1
With the explosive growth in mobile data traffic, ultra-dense network (UDN) where a large number of small cells are densely deployed on top of macro cells has received a great deal…
cs.IT2014
Greedy Sparse Signal Recovery with Tree Pruning
Jaeseok Lee, Suhyuk Kwon, Jun Won Choi +1
Recently, greedy algorithm has received much attention as a cost-effective means to reconstruct the sparse signals from compressed measurements. Much of previous work has focused o…