Zobrazeno 1 - 10
of 41 465
pro vyhledávání: '"Lehman, P."'
Autor:
Dutta, Sourav, Bhattacharya, Arnab
Graph isomorphism, a classical algorithmic problem, determines whether two input graphs are structurally identical or not. Interestingly, it is one of the few problems that is not yet known to belong to either the P or NP-complete complexity classes.
Externí odkaz:
http://arxiv.org/abs/2409.20157
Autor:
Chakrabarty, Deeparnab, Seshadhri, C.
Motivated by applications to monotonicity testing, Lehman and Ron (JCTA, 2001) proved the existence of a collection of vertex disjoint paths between comparable sub-level sets in the directed hypercube. The main technical contribution of this paper is
Externí odkaz:
http://arxiv.org/abs/2409.02206
Supervised learning has recently garnered significant attention in the field of computational physics due to its ability to effectively extract complex patterns for tasks like solving partial differential equations, or predicting material properties.
Externí odkaz:
http://arxiv.org/abs/2402.03838
Prior attacks on graph neural networks have mostly focused on graph poisoning and evasion, neglecting the network's weights and biases. Traditional weight-based fault injection attacks, such as bit flip attacks used for convolutional neural networks,
Externí odkaz:
http://arxiv.org/abs/2311.01205
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:
Roberto Soto, Luis Raúl Valdés
Publikováno v:
Ola Financiera, Vol 17, Iss 47, Pp 31-49 (2024)
En el presente trabajo se presentan algunas reflexiones sobre las similitudes y distancias entre el momento Lehman Brothers del 2008 y la inestabilidad que se observa en la actualidad en el sector inmobiliario chino. Para ello, se hace un recuento de
Externí odkaz:
https://doaj.org/article/99d0e2592af54101b82bc4548ea925a5
Autor:
Ting, Yuan-Sen, Sharma, Bhavesh
Stars' chemical signatures provide invaluable insights into stellar cluster formation. This study utilized the Weisfeiler-Lehman (WL) Graph Kernel to examine a 15-dimensional elemental abundance space. Through simulating chemical distributions using
Externí odkaz:
http://arxiv.org/abs/2306.14206
Message passing neural networks (MPNNs) have emerged as the most popular framework of graph neural networks (GNNs) in recent years. However, their expressive power is limited by the 1-dimensional Weisfeiler-Lehman (1-WL) test. Some works are inspired
Externí odkaz:
http://arxiv.org/abs/2306.03266
Autor:
Truong, Quang, Chin, Peter
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence 38 (14), 15382-15391, 2024
Graph Neural Networks (GNNs), despite achieving remarkable performance across different tasks, are theoretically bounded by the 1-Weisfeiler-Lehman test, resulting in limitations in terms of graph expressivity. Even though prior works on topological
Externí odkaz:
http://arxiv.org/abs/2308.06838
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.