David Stevens, Daniel Lowd. On the hardness of evading combinations of linear classifiers. In Ahmad-Reza Sadeghi, Blaine Nelson, Christos Dimitrakakis, Elaine Shi, editors, AISec'13, Proceedings of the 2013 ACM Workshop on Artificial Intelligence and Security, Co-located with CCS 2013, Berlin, Germany, November 4, 2013. pages 77-86, ACM, 2013. [doi]
@inproceedings{StevensL13,
title = {On the hardness of evading combinations of linear classifiers},
author = {David Stevens and Daniel Lowd},
year = {2013},
doi = {10.1145/2517312.2517318},
url = {http://doi.acm.org/10.1145/2517312.2517318},
researchr = {https://researchr.org/publication/StevensL13},
cites = {0},
citedby = {0},
pages = {77-86},
booktitle = {AISec'13, Proceedings of the 2013 ACM Workshop on Artificial Intelligence and Security, Co-located with CCS 2013, Berlin, Germany, November 4, 2013},
editor = {Ahmad-Reza Sadeghi and Blaine Nelson and Christos Dimitrakakis and Elaine Shi},
publisher = {ACM},
isbn = {978-1-4503-2488-5},
}