Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Spaccamela, Alberto Marchetti"'
Publikováno v:
Proceedings of IEEE ISI 2023 - 20th Annual IEEE International Conference on Intelligence and Security Informatics (ISI)
The growing adoption of IT solutions in the healthcare sector is leading to a steady increase in the number of cybersecurity incidents. As a result, organizations worldwide have introduced regulations, standards, and best practices to address cyberse
Externí odkaz:
http://arxiv.org/abs/2304.14955
Autor:
Amanatidis, Georgios, Fusco, Federico, Lazos, Philip, Leonardi, Stefano, Spaccamela, Alberto Marchetti, Reiffenhäuser, Rebecca
Publikováno v:
Proceedings of the 38th International Conference on Machine Learning, PMLR 139:231-242, 2021
Submodular maximization is a classic algorithmic problem with multiple applications in data mining and machine learning; there, the growing need to deal with massive instances motivates the design of algorithms balancing the quality of the solution w
Externí odkaz:
http://arxiv.org/abs/2102.08327
Publikováno v:
In Theoretical Computer Science 2009 410(27):2725-2731
Autor:
Donini, Francesco M., Hollunder, Bernhard, Lenzerini, Maurizio, Spaccamela, Alberto Marchetti, Nard, Daniele, Nutt, Werner
Much of the research on concept languages, also called terminological languages, has focused on the computational complexity of subsumption. The intractability results can be divided into two groups. First, it has been shown that extending the basic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf8eb7910c9d5abc66a6a5feecffac20
Publikováno v:
Algorithms & Computation (9783540496946); 2006, p527-536, 10p
Publikováno v:
Proceedings of the First Annual ACM-SIAM Symposium: Discrete Algorithms; Jan1990, p12-21, 10p
We consider the problem of dynamically maintaining general series parallel directed acyclic graphs (GSP dags), two-terminal series parallel directed acyclic graphs (TTSP dags) and looped series parallel directed graphs (looped SP digraphs). We presen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::061653c379c7dff4245cb6d78b9f9522
http://hdl.handle.net/11573/1205032
http://hdl.handle.net/11573/1205032
Publikováno v:
Journal of Discrete Algorithms; Sep2006, Vol. 4 Issue 3, p337-338, 2p
Publikováno v:
In Theoretical Computer Science 1992 95(2):245-261