20 citations · 23 across the 5 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.NI2012
On the Effect of Channel Fading on Greedy Scheduling
Akula Aneesh Reddy, Sujay Sanghavi, Sanjay Shakkottai
Greedy Maximal Scheduling (GMS) is an attractive low-complexity scheme for scheduling in wireless networks. Recent work has characterized its throughput for the case when there is…
stat.ML2012★ 1 cited
Greedy Learning of Markov Network Structure
Praneeth Netrapalli, Siddhartha Banerjee, Sujay Sanghavi +1
We propose a new yet natural algorithm for learning the graph structure of general discrete graphical models (a.k.a. Markov random fields) from samples. Our algorithm finds the nei…