Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Mpanti, A."'
Consider a graph $G$ which belongs to a graph class ${\cal C}$. We are interested in connecting a node $w \not\in V(G)$ to $G$ by a single edge $u w$ where $u \in V(G)$; we call such an edge a \emph{tail}. As the graph resulting from $G$ after the ad
Externí odkaz:
http://arxiv.org/abs/2302.00657
The minimum completion (fill-in) problem is defined as follows: Given a graph family $\mathcal{F}$ (more generally, a property $\Pi$) and a graph $G$, the completion problem asks for the minimum number of non-edges needed to be added to $G$ so that t
Externí odkaz:
http://arxiv.org/abs/2302.00112
Autor:
Eleni Gavriilaki, Emmanuel Nikolousis, Eudoxia-Evaggelia Koravou, Sotiria Dimou-Besikli, Charalampos Kartsios, Anna Papakonstantinou, Anastasia Mpanti, Charalampos Pontikoglou, Christina Kalpadaki, Aikaterini Bitsani, Ilianna Tassi, Tasoula Touloumenidou, Thomas Chatziconstantinou, Maria Papathanasiou, Antonia Syrigou, Eleutheria Ztriva, Georgia Kaiafa, Evdokia Mandala, Zois Mellios, Dimitrios Karakasis, Alexandra Kourakli, Argiris Symeonidis, Eleni Kapsali, Helen H. Papadaki, Chrysavgi Lalayanni, Ioanna Sakellari
Publikováno v:
Frontiers in Medicine, Vol 10 (2023)
Given the limited real-world data of caplacizumab, our multicenter real-world study was designed to assess the safety and efficacy of caplacizumab in immune thrombotic thrombocytopenic pupura (iTTP), compared to historic controls. We have studied 70
Externí odkaz:
https://doaj.org/article/0e47eee9cc9b45b8b1af651681d65d33
In the domain of software watermarking, we have proposed several graph theoretic watermarking codec systems for encoding watermark numbers $w$ as reducible permutation flow-graphs $F[\pi^*]$ through the use of self-inverting permutations $\pi^*$. Fol
Externí odkaz:
http://arxiv.org/abs/1812.11080
In this work we propose a graph-based model that, utilizing relations between groups of System-calls, distinguishes malicious from benign software samples and classifies the detected malicious samples to one of a set of known malware families. More p
Externí odkaz:
http://arxiv.org/abs/1812.10748
Two RPG Flow-graphs for Software Watermarking using Bitonic Sequences of Self-inverting Permutations
Autor:
Mpanti, Anna, Nikolopoulos, Stavros D.
Software watermarking has received considerable attention and was adopted by the software development community as a technique to prevent or discourage software piracy and copyright infringement. A wide range of software watermarking techniques has b
Externí odkaz:
http://arxiv.org/abs/1607.02281
Publikováno v:
Algorithms, Vol 16, Iss 6, p 289 (2023)
Consider a graph G which belongs to a graph class C. We are interested in connecting a node w∉V(G) to G by a single edge uw where u∈V(G); we call such an edge a tail. As the graph resulting from G after the addition of the tail, denoted G+uw, nee
Externí odkaz:
https://doaj.org/article/4b9e67c5081e4aaab564832af2f66953
Autor:
Mpanti, Anna1 (AUTHOR) ampanti@cs.uoi.gr, Nikolopoulos, Stavros D.1 (AUTHOR) stavros@cs.uoi.gr, Palios, Leonidas1 (AUTHOR) palios@cs.uoi.gr
Publikováno v:
Journal of Computer Security. 2023, Vol. 31 Issue 2, p107-128. 22p.
Publikováno v:
Journal of Computer Security. 31:107-128
Software watermarking is a defense technique used to prevent or discourage software piracy by embedding a signature in the code. In (Discrete Applied Mathematics 250 (2018) 145–164), a software watermarking system is presented which encodes an inte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb7039f5e669382e4c1549900f1ba170
https://doi.org/10.3233/jcs-210048
https://doi.org/10.3233/jcs-210048
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.