Search Results for author:
Found 4 papers, 1 papers with code
K-plex Cover Pooling for Graph Neural Networks
We introduce a novel pooling technique which borrows from classical results in graph theory that is non-parametric and generalizes well to graphs of different nature and connectivity pattern.
Possible multi-orbital ground state in CeCu$_2$Si$_2$
The crystal-field ground state wave function of CeCu$_2$Si$_2$ has been investigated with linear polarized $M$-edge x-ray absorption spectroscopy from 250mK to 250K, thus covering the superconducting ($T_{\text{c}}$=0. 6K), the Kondo ($T_{\text{K}}$$\approx$20K) as well as the Curie-Weiss regime.
Strongly Correlated Electrons
Proximity Search For Maximal Subgraph Enumeration
Using known techniques, such as reverse search, the space of all maximal solutions induces an implicit directed graph called "solution graph" or "supergraph", and solutions are enumerated by traversing it; however, nodes in this graph can have exponential out-degree, thus requiring exponential time to be spent on each solution.
Data Structures and Algorithms 05C30, 05C85 F.2.2
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies
Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata, are unlike context-free grammars in that they do not have a binary normal form.
