Face identification by means of a neural net classifier. (arXiv:2204.00305v1 [cs.CV])
This paper describes a novel face identification method that combines the eigenfaces theory with the Neural Nets. We use the eigenfaces methodology in order to reduce the dimensionality of the…
Face identification by means of a neural net classifier. (arXiv:2204.00305v1 [cs.CV])
This paper describes a novel face identification method that combines the eigenfaces theory with the Neural Nets. We use the eigenfaces methodology in order to reduce the dimensionality of the…
A solution approach for the anonymous sharing of sensitive supply chain traceability data. (arXiv:2204.00317v1 [cs.CR])
Supply chain traceability systems have become central in many industries, however, traceability data is often commercially sensitive, and firms seek to keep it confidential to protect their competitive advantage. This…
A solution approach for the anonymous sharing of sensitive supply chain traceability data. (arXiv:2204.00317v1 [cs.CR])
Supply chain traceability systems have become central in many industries, however, traceability data is often commercially sensitive, and firms seek to keep it confidential to protect their competitive advantage. This…
Robust and Accurate — Compositional Architectures for Randomized Smoothing. (arXiv:2204.00487v1 [cs.LG])
Randomized Smoothing (RS) is considered the state-of-the-art approach to obtain certifiably robust models for challenging tasks. However, current RS approaches drastically decrease standard accuracy on unperturbed data, severely limiting their…
Robust and Accurate — Compositional Architectures for Randomized Smoothing. (arXiv:2204.00487v1 [cs.LG])
Randomized Smoothing (RS) is considered the state-of-the-art approach to obtain certifiably robust models for challenging tasks. However, current RS approaches drastically decrease standard accuracy on unperturbed data, severely limiting their…
On the Hardness of the Lee Syndrome Decoding Problem. (arXiv:2002.12785v5 [cs.IT] UPDATED)
In this paper we study the hardness of the syndrome decoding problem over finite rings endowed with the Lee metric. We first prove that the decisional version of the problem…
On the Hardness of the Lee Syndrome Decoding Problem. (arXiv:2002.12785v5 [cs.IT] UPDATED)
In this paper we study the hardness of the syndrome decoding problem over finite rings endowed with the Lee metric. We first prove that the decisional version of the problem…
On Decidability of Existence of Nonblocking Supervisors Resilient to Smart Sensor Attacks. (arXiv:2009.02626v2 [cs.CR] UPDATED)
Cybersecurity of discrete event systems (DES) has been gaining more and more attention recently, due to its high relevance to the so-called 4th industrial revolution that heavily relies on data…
On Decidability of Existence of Nonblocking Supervisors Resilient to Smart Sensor Attacks. (arXiv:2009.02626v2 [cs.CR] UPDATED)
Cybersecurity of discrete event systems (DES) has been gaining more and more attention recently, due to its high relevance to the so-called 4th industrial revolution that heavily relies on data…