diff options
Diffstat (limited to 'biblio')
-rw-r--r-- | biblio/bibliography.bib | 76 |
1 files changed, 75 insertions, 1 deletions
diff --git a/biblio/bibliography.bib b/biblio/bibliography.bib index a8c040ed..a1b951e0 100644 --- a/biblio/bibliography.bib +++ b/biblio/bibliography.bib @@ -1076,7 +1076,7 @@ language={English} journal = {Computational Geometry: Theory and Applications}, volume = {58}, pages = {70--96}, - doi = "https://doi.org/10.1016/j.comgeo.2016.07.001", + doi = "10.1016/j.comgeo.2016.07.001", year = {2016} } @@ -1106,3 +1106,77 @@ language={English} doi = "10.1007/s00454-013-9513-1", year = {2013} } + +@InProceedings{boissonnat_et_al:LIPIcs:2015:5098, + author = {Jean-Daniel Boissonnat and Karthik C. S. and S{\'e}bastien Tavenas}, + title = {{Building Efficient and Compact Data Structures for Simplicial Complexes}}, + booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, + pages = {642--656}, + series = {Leibniz International Proceedings in Informatics (LIPIcs)}, + ISBN = {978-3-939897-83-5}, + ISSN = {1868-8969}, + year = {2015}, + volume = {34}, + editor = {Lars Arge and J{\'a}nos Pach}, + publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, + address = {Dagstuhl, Germany}, + URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5098}, + URN = {urn:nbn:de:0030-drops-50981}, + doi = {10.4230/LIPIcs.SOCG.2015.642}, + annote = {Keywords: Simplicial complex, Compact data structures, Automaton, NP-hard} +} + +@article{DBLP:journals/corr/BoissonnatS16, + author = {Jean{-}Daniel Boissonnat and + {Karthik {C. S.}}}, + title = {An Efficient Representation for Filtrations of Simplicial Complexes}, + journal = {CoRR}, + volume = {abs/1607.08449}, + year = {2016}, + url = {http://arxiv.org/abs/1607.08449}, + archivePrefix = {arXiv}, + eprint = {1607.08449}, + timestamp = {Mon, 13 Aug 2018 16:46:26 +0200}, + biburl = {https://dblp.org/rec/bib/journals/corr/BoissonnatS16}, + bibsource = {dblp computer science bibliography, https://dblp.org} +} + +@article{Kerber:2017:GHC:3047249.3064175, + author = {Kerber, Michael and Morozov, Dmitriy and Nigmetov, Arnur}, + title = {Geometry Helps to Compare Persistence Diagrams}, + journal = {J. Exp. Algorithmics}, + issue_date = {2017}, + volume = {22}, + month = sep, + year = {2017}, + issn = {1084-6654}, + pages = {1.4:1--1.4:20}, + articleno = {1.4}, + numpages = {20}, + url = {http://doi.acm.org/10.1145/3064175}, + doi = {10.1145/3064175}, + acmid = {3064175}, + publisher = {ACM}, + address = {New York, NY, USA}, + keywords = {Assignment problems, bipartite matching, k-d tree, persistent homology}, +} +@InProceedings{pmlr-v70-carriere17a, + title = {Sliced {W}asserstein Kernel for Persistence Diagrams}, + author = {Mathieu Carri{\`e}re and Marco Cuturi and Steve Oudot}, + booktitle = {Proceedings of the 34th International Conference on Machine Learning}, + pages = {664--673}, + year = {2017}, + editor = {Doina Precup and Yee Whye Teh}, + volume = {70}, + series = {Proceedings of Machine Learning Research}, + address = {International Convention Centre, Sydney, Australia}, + month = {06--11 Aug}, + publisher = {PMLR}, +} + +@INPROCEEDINGS{Rahimi07randomfeatures, + author = {Ali Rahimi and Ben Recht}, + title = {Random features for large-scale kernel machines}, + booktitle = {In Neural Information Processing Systems}, + year = {2007} +} |