Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Shintaro NARISADA"'
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :241-252
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::67c5e48abc00463cb2b5e5d52d44d54f
https://doi.org/10.1587/transfun.2022cip0023
https://doi.org/10.1587/transfun.2022cip0023
Publikováno v:
Proceedings of the 9th International Conference on Information Systems Security and Privacy.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::876d417185d6ab603dcf5bb885d6edad
https://doi.org/10.5220/0011618000003405
https://doi.org/10.5220/0011618000003405
Publikováno v:
Proceedings of the 15th International Conference on Agents and Artificial Intelligence.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc9e15fb55099e27fb6408894e7f80e0
https://doi.org/10.5220/0011617800003393
https://doi.org/10.5220/0011617800003393
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :79-88
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04177d6ac3b3106e367e1c91e0da1525
https://doi.org/10.1587/transfun.2020cip0014
https://doi.org/10.1587/transfun.2020cip0014
Publikováno v:
Theoretical Computer Science. 812:187-202
We consider the problem of inferring an edge-labeled graph from the sequence of edge labels seen in a walk on that graph. It has been known that this problem is solvable in O ( n log n ) time when the targets are path or cycle graphs. This paper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::443eac14df16c79bb8a8a7087070340b
https://doi.org/10.1016/j.tcs.2019.10.029
https://doi.org/10.1016/j.tcs.2019.10.029
Publikováno v:
2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed8098624eb42f151ae323ca20927b5e
https://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom52081.2021.00136
https://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom52081.2021.00136
Autor:
Shintaro Narisada, Yuki Matsumoto, Seira Hidano, Toshihiro Uchibayashi, Takuo Suganuma, Masahiro Hiji, Shinsaku Kiyomoto
Publikováno v:
Cryptology and Network Security ISBN: 9783030925475
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f2533b8fbc0f2ef913113d043d0ad7a
https://doi.org/10.1007/978-3-030-92548-2_16
https://doi.org/10.1007/978-3-030-92548-2_16
Autor:
Toshihiro Uchibayashi, Masahiro Hiji, Shoichiro Sasaki, Takuo Suganuma, Seira Hidano, Shintaro Narisada, Shinsaku Kiyomoto
Publikováno v:
Cryptology and Network Security ISBN: 9783030654108
CANS
CANS
Attacks on machine learning systems such as malware detectors and recommendation systems are becoming a major threat. Data poisoning attacks are the primary method used; they inject a small amount of poisoning points into a training set of the machin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32d57b18d251c5510b3accde5f6d64f9
https://doi.org/10.1007/978-3-030-65411-5_4
https://doi.org/10.1007/978-3-030-65411-5_4
Publikováno v:
String Processing and Information Retrieval ISBN: 9783030004781
SPIRE
SPIRE
We consider the problem of inferring an edge-labeled graph from the sequence of edge labels seen in a walk of that graph. It has been known that this problem is solvable in \(\mathrm {O}(n \log n)\) time when the targets are path or cycle graphs. Thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eba3cf8b84696bffaf8c18d2b9d86adf
https://doi.org/10.1007/978-3-030-00479-8_25
https://doi.org/10.1007/978-3-030-00479-8_25
Publikováno v:
SOFSEM 2017: Theory and Practice of Computer Science ISBN: 9783319519623
SOFSEM
SOFSEM
We introduce new types of approximate palindromes called single-arm-gapped palindromes (SAGPs). A SAGP contains a gap in either its left or right arm, which is in the form of either \(wguc u^R w^R\) or \(wuc u^Rgw^R\), where w and u are non-empty str
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f5a5e5893102efe271127aac87345a6
https://doi.org/10.1007/978-3-319-51963-0_29
https://doi.org/10.1007/978-3-319-51963-0_29