Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Mpanti, Anna"'
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
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
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.
Autor:
Dounavi, Helen-Maria1 (AUTHOR) edounavi@cse.uoi.gr, Mpanti, Anna1 (AUTHOR) ampanti@cs.uoi.gr, Nikolopoulos, Stavros D.1 (AUTHOR) edounavi@cse.uoi.gr, Polenakis, Iosif1 (AUTHOR)
Publikováno v:
Journal of Computer Security. 2021, Vol. 29 Issue 6, p651-688. 38p.
Autor:
Mpanti, Anna
In graph modification problems, we have to repair, improve, or adjust a graph to satisfy appropriate properties while minimizing the cost of the modification. The study of graph modification problems is crucial to computer science as they find applic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2e7357bbec7c62469191f40db5f69a5
https://olympias.lib.uoi.gr/jspui/handle/123456789/32272
https://olympias.lib.uoi.gr/jspui/handle/123456789/32272
A classic result of Edmonds states that the maximum number of edge-disjoint arborescences of a directed graph G, rooted at a designated vertex s, equals the minimum cardinality c_G(s) of an s-cut of G. This concept is related to the edge connectivity
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82022d5afef0d7713842c30048b16d88
Publikováno v:
ACM International Conference Proceeding Series; 9/13/2018, p20-26, 7p