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

Info hash781510d86759f5991a9a465120e26f4ef5088f6d
Last mirror activity5d,13:09:00 ago
Size300.92kB (300,917 bytes)
Added2014-04-28 02:05:13
Views1428
Hits24834
ID2472
Typesingle
Downloaded805 time(s)
Uploaded by gravatar.com icon for user henryzlo
FilenameMessage-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes.pdf
Mirrors5 complete, 0 downloading = 5 mirror(s) total [Log in to see full list]

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.000403
Lookup hash in DB
   0.000375
Get torrent details
   0.000130
Get torrent details, finished
   0.000208
Get authors
   0.000001
Select authors
   0.000181
Parse bibtex
   0.000086
Write header
   0.000197
get stars
   0.000100
target tab
   0.000006
Request peers
   0.000275
Write table
   0.000014
geoloc peers
   0.016729
render right panel
   0.000009
render ads
   0.000640
fetch current hosters
   0.000263
Start get stats
   0.000412
End get stats
   0.000001
related datasets
   0.000941
Done