Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
publications:bibtex [2018/02/26 13:08] – guilherme | publications:bibtex [2018/12/14 16:08] (current) – guilherme | ||
---|---|---|---|
Line 68: | Line 68: | ||
pages = {673--686}, | pages = {673--686}, | ||
| | ||
- | url = {https:// | ||
doi = {10.1007/ | doi = {10.1007/ | ||
acmid = {3127610}, | acmid = {3127610}, | ||
Line 207: | 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 272: | 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 292: | Line 308: | ||
pages = {11:1--15}, | pages = {11:1--15}, | ||
doi = {10.4230/ | doi = {10.4230/ | ||
+ | url = {http:// | ||
year = {2016}, | year = {2016}, | ||
} | } | ||
Line 301: | Line 318: | ||
pages = {270--288}, | pages = {270--288}, | ||
doi = {10.1137/ | doi = {10.1137/ | ||
+ | url = {http:// | ||
year = {2017}, | year = {2017}, | ||
} | } | ||
Line 310: | 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, | ||
Line 498: | Line 526: | ||
} | } | ||
+ | @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}, | ||
+ | } |