Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
Martin J. Wainwright and Pradeep Ravikumar and Alekh Agarwal

Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes.pdf 300.92kB
Type: Paper
Tags:

Metadata:
@article{11:34,author={Pradeep Ravikumar and Alekh Agarwal and Martin J. Wainwright}, Title={Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes},journal={Journal of Machine Learning Research},volume={11}, url={http://www.jmlr.org/papers/volume11/ravikumar10a/ravikumar10a.pdf}}
Citation:
Wainwright, M. J., Ravikumar, P., & Agarwal, A.. (2014). Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes [Data set]. Academic Torrents. https://academictorrents.com/details/781510d86759f5991a9a465120e26f4ef5088f6d
10 day statistics (1 downloads)
Average Time 3 hrs, 39 mins, 17 secs
Average Speed 0.02kB/s
Best Time 3 hrs, 39 mins, 17 secs
Best Speed 0.02kB/s
Worst Time 3 hrs, 39 mins, 17 secs
Worst Speed 0.02kB/s

Send Feedback Start
   0.000006
DB Connect
   0.000458
Lookup hash in DB
   0.000390
Get torrent details
   0.000119
Get torrent details, finished
   0.000203
Get authors
   0.000002
Select authors
   0.000166
Parse bibtex
   0.000086
Write header
   0.000224
get stars
   0.000116
home tab
   0.000126
render right panel
   0.000004
render ads
   0.000314
fetch current hosters
   0.000209
Start get stats
   0.000420
End get stats
   0.000001
related datasets
   0.000969
Done