diff options
| author | Thibaut Horel <thibaut.horel@gmail.com> | 2015-05-18 16:15:36 +0200 |
|---|---|---|
| committer | Thibaut Horel <thibaut.horel@gmail.com> | 2015-05-18 16:15:36 +0200 |
| commit | 3d818b2861faf0ccdbcb2eeb6ac90a07f4e4374a (patch) | |
| tree | bd8ddc791438b3259d00a2d3683da166c05da04c /paper/sections/intro.tex | |
| parent | ae5730b6d30d82c60b1a5d66f2931f450e312afd (diff) | |
| download | cascades-3d818b2861faf0ccdbcb2eeb6ac90a07f4e4374a.tar.gz | |
Pass on results section
Diffstat (limited to 'paper/sections/intro.tex')
| -rw-r--r-- | paper/sections/intro.tex | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/paper/sections/intro.tex b/paper/sections/intro.tex index 4c18faf..c89c641 100644 --- a/paper/sections/intro.tex +++ b/paper/sections/intro.tex @@ -72,7 +72,6 @@ be sufficient to recover the graph~\cite{donoho2006compressed, candes2006near}. However, the best known upper bound to this day is $\O(s^2\log m)$~\cite{Netrapalli:2012, Daneshmand:2014} - The contributions of this paper are the following: \begin{itemize} \item we formulate the Graph Inference problem in the context of |