aboutsummaryrefslogtreecommitdiffstats
path: root/paper/sparse.bib
diff options
context:
space:
mode:
authorjeanpouget-abadie <jean.pougetabadie@gmail.com>2015-01-28 16:09:43 -0500
committerjeanpouget-abadie <jean.pougetabadie@gmail.com>2015-01-28 16:09:43 -0500
commita9972e9bf028bc337ffd448791b242f1c92cc21c (patch)
treebff02d7f6e08e183f03f10aa45020f8bcde366c2 /paper/sparse.bib
parentda4efddb21fc7fc9c92e9ea54c4421268697d829 (diff)
downloadcascades-a9972e9bf028bc337ffd448791b242f1c92cc21c.tar.gz
adding missed files
Diffstat (limited to 'paper/sparse.bib')
-rw-r--r--paper/sparse.bib48
1 files changed, 32 insertions, 16 deletions
diff --git a/paper/sparse.bib b/paper/sparse.bib
index 969e45d..10ae8ca 100644
--- a/paper/sparse.bib
+++ b/paper/sparse.bib
@@ -80,26 +80,42 @@ year = {2006},
{ICML} 2014, Beijing, China, 21-26 June 2014},
pages = {793--801},
year = {2014},
- crossref = {DBLP:conf/icml/2014},
url = {http://jmlr.org/proceedings/papers/v32/daneshmand14.html},
timestamp = {Fri, 07 Nov 2014 20:42:30 +0100},
biburl = {http://dblp.uni-trier.de/rec/bib/conf/icml/DaneshmandGSS14},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
-\bibitem{abrahao}
-Abrahao, B., Chierichetti, F., Kleinberg, R., and Panconesi, A.
-\newblock{\it Trace Complexity of Network Inference}
-\newblock In Proc. 19th ACM SIGKDD international conference on Knowledge discovery and data mingin, KDD'13, pages 491--499,
-\newblock 2013
-
-\bibitem{candes}
-Candès, E., and Plan, Y.
-\newblock {\it A Probabilistic and RIPless Theory of Compressed Sensing}
-\newblock Information Theory, IEEE Transactions on, 57(11): 7235--7254,
-\newblock 2011.
+@inproceedings{Kempe:03,
+ author = {David Kempe and
+ Jon M. Kleinberg and
+ {\'{E}}va Tardos},
+ title = {Maximizing the spread of influence through a social network},
+ booktitle = {Proceedings of the Ninth {ACM} {SIGKDD} International Conference on
+ Knowledge Discovery and Data Mining, Washington, DC, USA, August 24
+ - 27, 2003},
+ pages = {137--146},
+ year = {2003},
+ url = {http://doi.acm.org/10.1145/956750.956769},
+ doi = {10.1145/956750.956769},
+ timestamp = {Mon, 13 Feb 2006 15:34:20 +0100},
+ biburl = {http://dblp.uni-trier.de/rec/bib/conf/kdd/KempeKT03},
+ bibsource = {dblp computer science bibliography, http://dblp.org}
+}
-\bibitem{snap}
-Leskovec, J., and Krevl, A.,
-\newblock {\it SNAP Datasets: Stanford Large Network Dataset Collection},
-\newblock 2014. \ No newline at end of file
+@inproceedings{Abrahao:13,
+ author = {Bruno D. Abrahao and
+ Flavio Chierichetti and
+ Robert Kleinberg and
+ Alessandro Panconesi},
+ title = {Trace complexity of network inference},
+ booktitle = {The 19th {ACM} {SIGKDD} International Conference on Knowledge Discovery
+ and Data Mining, {KDD} 2013, Chicago, IL, USA, August 11-14, 2013},
+ pages = {491--499},
+ year = {2013},
+ url = {http://doi.acm.org/10.1145/2487575.2487664},
+ doi = {10.1145/2487575.2487664},
+ timestamp = {Tue, 10 Sep 2013 10:11:57 +0200},
+ biburl = {http://dblp.uni-trier.de/rec/bib/conf/kdd/AbrahaoCKP13},
+ bibsource = {dblp computer science bibliography, http://dblp.org}
+}