Zobrazeno 1 - 10
of 120
pro vyhledávání: '"Zoppis, Italo"'
With the recent success of artificial intelligence in neuroscience, a number of deep learning (DL) models were proposed for classification, anomaly detection, and pattern recognition tasks in electroencephalography (EEG). EEG is a multi-channel time-
Externí odkaz:
http://arxiv.org/abs/2312.00799
Publikováno v:
Ziefle, M., Lozano, M.D., Mulvenna, M. (eds) Information and Communication Technologies for Ageing Well and e-Health. ICT4AWE 2023. Communications in Computer and Information Science, Springer
Electroencephalografic (EEG) data are complex multi-dimensional time-series that are very useful in many applications, from diagnostics to driving brain-computer interface systems. Their classification is still a challenging task, due to the inherent
Externí odkaz:
http://arxiv.org/abs/2312.09449
Autor:
Cisotto, Giulia, Trentini, Andrea, Zoppis, Italo, Zanga, Alessio, Manzoni, Sara, Pietrabissa, Giada, Usubini, Anna Guerrini, Castelnuovo, Gianluca
As the worldwide population gets increasingly aged, in-home telemedicine and mobile-health solutions represent promising services to promote active and independent aging and to contribute to a paradigm shift towards patient-centric healthcare. In thi
Externí odkaz:
http://arxiv.org/abs/2102.08692
Autor:
Cisotto, Giulia, Zanga, Alessio, Chlebus, Joanna, Zoppis, Italo, Manzoni, Sara, Markowska-Kaczmar, Urszula
Objective: To evaluate the impact on Electroencephalography (EEG) classification of different kinds of attention mechanisms in Deep Learning (DL) models. Methods: We compared three attention-enhanced DL models, the brand-new InstaGATs, an LSTM with a
Externí odkaz:
http://arxiv.org/abs/2012.01074
The problem of matching a query string to a directed graph, whose vertices are labeled by strings, has application in different fields, from data mining to computational biology. Several variants of the problem have been considered, depending on the
Externí odkaz:
http://arxiv.org/abs/2001.01961
A central problem in graph mining is finding dense subgraphs, with several applications in different fields, a notable example being identifying communities. While a lot of effort has been put on the problem of finding a single dense subgraph, only r
Externí odkaz:
http://arxiv.org/abs/1809.02434
Finding cohesive subgraphs in a network is a well-known problem in graph theory. Several alternative formulations of cohesive subgraph have been proposed, a notable example being $s$-club, which is a subgraph where each vertex is at distance at most
Externí odkaz:
http://arxiv.org/abs/1806.01119
Publikováno v:
In Information and Computation October 2022 288
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.
Autor:
Galli, Manuel, Pagni, Fabio, De Sio, Gabriele, Smith, Andrew, Chinello, Clizia, Stella, Martina, L'Imperio, Vincenzo, Manzoni, Marco, Garancini, Mattia, Massimini, Diego, Mosele, Niccolò, Mauri, Giancarlo, Zoppis, Italo, Magni, Fulvio
Publikováno v:
In BBA - Proteins and Proteomics July 2017 1865(7):817-827