![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Daniël Vos
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j1]Yingqian Zhang
, Laurens Bliek
, Paulo da Costa, Reza Refaei Afshar, Robbert Reijnen, Tom Catshoek, Daniël Vos, Sicco Verwer, Fynn Schmitt-Ulms, André Hottung, Tapan Shah, Meinolf Sellmann, Kevin Tierney
, Carl Perreault-Lafleur, Caroline Leboeuf, Federico Bobbio, Justine Pepin, Warley Almeida Silva, Ricardo Gama
, Hugo L. Fernandes, Martin Zaefferer, Manuel López-Ibáñez
, Ekhine Irurozki:
The first AI4TSP competition: Learning to solve stochastic routing problems. Artif. Intell. 319: 103918 (2023) - [c6]Azqa Nadeem, Daniël Vos, Clinton Cao, Luca Pajola, Simon Dieck, Robert Baumgartner, Sicco Verwer:
SoK: Explainable Machine Learning for Computer Security Applications. EuroS&P 2023: 221-240 - [c5]Daniël Vos, Sicco Verwer:
Optimal Decision Tree Policies for Markov Decision Processes. IJCAI 2023: 5457-5465 - [i7]Daniël Vos, Sicco Verwer:
Optimal Decision Tree Policies for Markov Decision Processes. CoRR abs/2301.13185 (2023) - [i6]Daniël Vos, Jelle Vos, Tianyu Li, Zekeriya Erkin, Sicco Verwer:
Differentially-Private Decision Trees with Probabilistic Robustness to Data Poisoning. CoRR abs/2305.15394 (2023) - 2022
- [c4]Daniël Vos, Sicco Verwer:
Robust Optimal Classification Trees against Adversarial Examples. AAAI 2022: 8520-8528 - [c3]Jelle Vos
, Daniël Vos
, Zekeriya Erkin
:
Efficient Circuits for Permuting and Mapping Packed Values Across Leveled Homomorphic Ciphertexts. ESORICS (1) 2022: 408-423 - [c2]Daniël Vos
, Sicco Verwer
:
Adversarially Robust Decision Tree Relabeling. ECML/PKDD (3) 2022: 203-218 - [i5]Laurens Bliek
, Paulo da Costa, Reza Refaei Afshar, Yingqian Zhang
, Tom Catshoek, Daniël Vos, Sicco Verwer, Fynn Schmitt-Ulms, André Hottung, Tapan Shah, Meinolf Sellmann, Kevin Tierney, Carl Perreault-Lafleur, Caroline Leboeuf, Federico Bobbio, Justine Pepin, Warley Almeida Silva, Ricardo Gama, Hugo L. Fernandes, Martin Zaefferer, Manuel López-Ibáñez, Ekhine Irurozki:
The First AI4TSP Competition: Learning to Solve Stochastic Routing Problems. CoRR abs/2201.10453 (2022) - [i4]Azqa Nadeem, Daniël Vos, Clinton Cao, Luca Pajola, Simon Dieck, Robert Baumgartner, Sicco Verwer:
SoK: Explainable Machine Learning for Computer Security Applications. CoRR abs/2208.10605 (2022) - 2021
- [c1]Daniël Vos, Sicco Verwer:
Efficient Training of Robust Decision Trees Against Adversarial Examples. ICML 2021: 10586-10595 - [i3]Daniël Vos, Sicco Verwer:
Robust Optimal Classification Trees Against Adversarial Examples. CoRR abs/2109.03857 (2021) - 2020
- [i2]Daniël Vos, Sicco Verwer:
Efficient Training of Robust Decision Trees Against Adversarial Examples. CoRR abs/2012.10438 (2020)
2010 – 2019
- 2018
- [i1]Daniël Vos, Leon Overweel, Wouter Raateland, Jelle Vos, Matthijs Bijman, Max Pigmans, Zekeriya Erkin:
DEFenD: A Secure and Privacy-Preserving Decentralized System for Freight Declaration. CoRR abs/1803.09257 (2018)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint