1k citations
- University of OxfordGB52 papers
- Centre National de la Recherche ScientifiqueFR50 papers
- University of SussexGB42 papers
- University of California, BerkeleyUS39 papers
- Goddard Space Flight CenterUS38 papers
- The University of Texas at AustinUS32 papers
- University of ManchesterGB32 papers
- Rochester Institute of TechnologyUS31 papers
- Search for Extraterrestrial IntelligenceUS31 papers
- Texas A&M UniversityUS27 papers
- Deleted Institution26 papers
- Mitchell InstituteUS26 papers
41 papers · 1 filter
-Core Distance Partitions
Xandru Mifsud
The -core vertices of a graph correspond to the non-zero entries of some eigenvector of for a universal adjacency matrix of the graph. We define a partition of…
Explainable AI for Interpretable Credit Scoring
Lara Marie Demajo, Vince Vella, Alexiei Dingli
With the ever-growing achievements in Artificial Intelligence (AI) and the recent boosted enthusiasm in Financial Technology (FinTech), applications such as credit scoring have gai…
Generalised Proca Theories in Teleparallel Gravity
Gianbattista-Piero Nicosia, Jackson Levi Said, Viktor Gakis
Generalised Proca theories of gravity represent an interesting class of vector-tensor theories where only three propagating degrees of freedom are present. In this work, we propose…
A note on fractional covers of a graph
John Baptist Gauci, Jean Paul Zerafa
A fractional colouring of a graph is a function that assigns a non-negative real value to all possible colour-classes of containing any vertex of , such that the sum of…
Two-excitation routing via linear quantum channels
Tony John George Apollaro, Wayne Jordan Chetcuti
Routing quantum information among different nodes in a network is a fundamental prerequisite for a quantum internet. While single-qubit routing has been largely addressed, many-qub…
Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants
John Baptist Gauci, Jean Paul Zerafa
Let be a graph of even order and let be the complete graph on the same vertex set of . A pairing of a graph is a perfect matching of the graph . A graph $…