Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
publications:bibtex [2018/02/21 09:53] – guilherme | publications:bibtex [2018/12/14 16:08] (current) – guilherme | ||
---|---|---|---|
Line 5: | Line 5: | ||
year = {2018}, | year = {2018}, | ||
volume = {352}, | volume = {352}, | ||
- | url = {https:// | ||
doi = {10.1016/ | doi = {10.1016/ | ||
pages = {26--37}, | pages = {26--37}, | ||
Line 20: | Line 19: | ||
number = {4}, | number = {4}, | ||
issn = {2169-9356}, | issn = {2169-9356}, | ||
- | url = {http:// | ||
doi = {10.1002/ | doi = {10.1002/ | ||
pages = {2367--2387}, | pages = {2367--2387}, | ||
Line 35: | Line 33: | ||
@book{CMVB18, | @book{CMVB18, | ||
- | author | + | author |
title = {Apprentissage artificiel - 3e édition: Concepts et algorithmes}, | title = {Apprentissage artificiel - 3e édition: Concepts et algorithmes}, | ||
year = {To appear}, | year = {To appear}, | ||
Line 52: | Line 50: | ||
year = {2015}, | year = {2015}, | ||
crossref | crossref | ||
- | url = {https:// | ||
doi = {10.1007/ | doi = {10.1007/ | ||
timestamp = {Thu, 25 May 2017 01:00:00 +0200}, | timestamp = {Thu, 25 May 2017 01:00:00 +0200}, | ||
Line 71: | Line 68: | ||
pages = {673--686}, | pages = {673--686}, | ||
| | ||
- | url = {https:// | ||
doi = {10.1007/ | doi = {10.1007/ | ||
acmid = {3127610}, | acmid = {3127610}, | ||
Line 91: | Line 87: | ||
issn=" | issn=" | ||
doi=" | doi=" | ||
- | url=" | ||
} | } | ||
Line 101: | Line 96: | ||
number = {4}, | number = {4}, | ||
issn = {2169-9356}, | issn = {2169-9356}, | ||
- | url = {http:// | ||
doi = {10.1002/ | doi = {10.1002/ | ||
pages = {2367--2387}, | pages = {2367--2387}, | ||
Line 150: | Line 144: | ||
year = {2015}, | year = {2015}, | ||
crossref | crossref | ||
- | url = {https:// | ||
doi = {10.1007/ | doi = {10.1007/ | ||
timestamp = {Thu, 25 May 2017 01:00:00 +0200}, | timestamp = {Thu, 25 May 2017 01:00:00 +0200}, | ||
Line 213: | Line 206: | ||
} | } | ||
+ | @inproceedings{convexification_conf, | ||
+ | author = {Abdelkader, | ||
+ | booktitle = {ACM-SIAM Symposium on Discrete Algorithms (SODA 2019)}, | ||
+ | title = {Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances}, | ||
+ | pages = {}, | ||
+ | doi = {}, | ||
+ | url = {}, | ||
+ | year = {2019}, | ||
+ | } | ||
@article{r11, | @article{r11, | ||
Line 253: | Line 255: | ||
| | ||
year = {2017}, | year = {2017}, | ||
- | note = {\url{http:// | + | url = {http:// |
} | } | ||
Line 260: | Line 262: | ||
journal = {SIAM Journal on Computing}, | journal = {SIAM Journal on Computing}, | ||
title = {Approximate Polytope Membership Queries}, | title = {Approximate Polytope Membership Queries}, | ||
- | | + | |
doi = {10.1137/ | doi = {10.1137/ | ||
journal = {SIAM Journal on Computing}, | journal = {SIAM Journal on Computing}, | ||
Line 278: | Line 280: | ||
number = {4}, | number = {4}, | ||
pages = {849--870}, | pages = {849--870}, | ||
- | | + | |
+ | } | ||
+ | |||
+ | @article{r17, | ||
+ | | ||
+ | title = {Efficient Independent Set Approximation in Unit Disk Graphs}, | ||
+ | | ||
+ | doi = {10.1016/ | ||
+ | year = {2018}, | ||
} | } | ||
Line 298: | Line 308: | ||
pages = {11:1--15}, | pages = {11:1--15}, | ||
doi = {10.4230/ | doi = {10.4230/ | ||
+ | url = {http:// | ||
year = {2016}, | year = {2016}, | ||
} | } | ||
Line 307: | Line 318: | ||
pages = {270--288}, | pages = {270--288}, | ||
doi = {10.1137/ | doi = {10.1137/ | ||
+ | url = {http:// | ||
year = {2017}, | year = {2017}, | ||
} | } | ||
Line 316: | Line 328: | ||
pages = {10:1--15}, | pages = {10:1--15}, | ||
doi = {10.4230/ | doi = {10.4230/ | ||
+ | url = {http:// | ||
year = {2017}, | year = {2017}, | ||
} | } | ||
+ | @inproceedings{c14, | ||
+ | author = {Arya, Sunil and da Fonseca, Guilherme D. and Mount, David M.}, | ||
+ | booktitle = {European Symposium on Algorithms (ESA)}, | ||
+ | title = {Approximate Convex Intersection Detection with Applications to Width and {M}inkowski Sums}, | ||
+ | pages = {3:1--14}, | ||
+ | doi = {10.4230/ | ||
+ | url = {http:// | ||
+ | year = {2018}, | ||
+ | } | ||
@article{chafik16, | @article{chafik16, | ||
author | author | ||
Qian Xie and | Qian Xie and | ||
- | Chafi, Samir and | + | Chafik, Samir and |
| | ||
year = {2016}, | year = {2016}, | ||
Line 444: | Line 466: | ||
} | } | ||
+ | @article{DBLP: | ||
+ | author | ||
+ | title = {About the Decidability of Polyhedral Separability in the Lattice Z^d | ||
+ | - Recognizing Digital Polyhedra with a Prescribed Number of Faces}, | ||
+ | journal | ||
+ | volume | ||
+ | number | ||
+ | pages = {52--68}, | ||
+ | year = {2017} | ||
+ | } | ||
+ | @inproceedings{DBLP: | ||
+ | author | ||
+ | title = {Recognition of Digital Polyhedra with a Fixed Number of Faces Is Decidable | ||
+ | in Dimension 3}, | ||
+ | booktitle = {{DGCI}}, | ||
+ | series | ||
+ | volume | ||
+ | pages = {279--290}, | ||
+ | publisher = {Springer}, | ||
+ | year = {2017} | ||
+ | } | ||
+ | |||
+ | @article{DBLP: | ||
+ | author | ||
+ | | ||
+ | | ||
+ | title = {Tight bounds in the quadtree complexity theorem and the maximal number | ||
+ | of pixels crossed by a curve of given length}, | ||
+ | journal | ||
+ | volume | ||
+ | pages = {41--55}, | ||
+ | year = {2016} | ||
+ | } | ||
+ | |||
+ | @inproceedings{DBLP: | ||
+ | author | ||
+ | title = {Recognition of Digital Polyhedra with a Fixed Number of Faces}, | ||
+ | booktitle = {{DGCI}}, | ||
+ | series | ||
+ | volume | ||
+ | pages = {415--426}, | ||
+ | publisher = {Springer}, | ||
+ | year = {2016} | ||
+ | } | ||
+ | |||
+ | @article{DBLP: | ||
+ | author | ||
+ | Yan G{\' | ||
+ | | ||
+ | Toby Collins and | ||
+ | | ||
+ | title = {Shape-from-Template}, | ||
+ | journal | ||
+ | volume | ||
+ | number | ||
+ | pages = {2099--2118}, | ||
+ | year = {2015} | ||
+ | } | ||
+ | |||
+ | @inproceedings{DBLP: | ||
+ | author | ||
+ | | ||
+ | | ||
+ | title = {Manifold-Based Inference for a Supervised Gaussian Process Classifier}, | ||
+ | booktitle = {2018 {IEEE} International Conference on Acoustics, Speech and Signal | ||
+ | | ||
+ | pages = {4239--4243}, | ||
+ | year = {2018}, | ||
+ | doi = {10.1109/ | ||
+ | } | ||
+ | |||
+ | @inproceedings{DBLP: | ||
+ | author | ||
+ | | ||
+ | | ||
+ | title = {M{\' | ||
+ | | ||
+ | | ||
+ | booktitle = {Actes de la Conf{\' | ||
+ | et Rencontres des Jeunes Chercheurs en Intelligence Artificielle {(CNIA+RJCIA} | ||
+ | | ||
+ | pages = {19--26}, | ||
+ | year = {2018}, | ||
+ | url = {http:// | ||
+ | } | ||
+ | |||
+ | @inproceedings{DBLP: | ||
+ | author | ||
+ | | ||
+ | | ||
+ | title = {Inf{\' | ||
+ | | ||
+ | | ||
+ | | ||
+ | booktitle = {Actes de la Conf{\' | ||
+ | et Rencontres des Jeunes Chercheurs en Intelligence Artificielle {(CNIA+RJCIA} | ||
+ | | ||
+ | pages = {43--49}, | ||
+ | year = {2018}, | ||
+ | url = {http:// | ||
+ | } | ||
+ | |||
+ | @inproceedings{digitalconvexity, | ||
+ | author = {Lo\" | ||
+ | booktitle = {International Conference on Discrete Geometry for Computer Imagery (DGCI 2019)}, | ||
+ | title = {Efficient Algorithms to Test Digital Convexity}, | ||
+ | pages = {}, | ||
+ | doi = {}, | ||
+ | url = {}, | ||
+ | year = {2019}, | ||
+ | } |