Results 21 to 30 of about 554,031 (298)

Named Graphs for Semantic Representation [PDF]

open access: yesProceedings of the Seventh Joint Conference on Lexical and Computational Semantics, 2018
A position paper arguing that purely graphical representations for natural language semantics lack a fundamental degree of expressiveness, and cannot deal with even basic Boolean operations like negation or disjunction. Moving from graphs to named graphs leads to representations that stand some chance of having sufficient expressive power.
Richard Crouch, Aikaterini-Lida Kalouli
openaire   +1 more source

Introducing New Exponential Zagreb Indices for Graphs

open access: yesJournal of Mathematics, 2021
New graph invariants, named exponential Zagreb indices, are introduced for more than one type of Zagreb index. After that, in terms of exponential Zagreb indices, lists on equality results over special graphs are presented as well as some new bounds on ...
Nihat Akgunes, Busra Aydin
doaj   +1 more source

Uniform Single Valued Neutrosophic Graphs [PDF]

open access: yesNeutrosophic Sets and Systems, 2017
In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic ...
S. Broumi   +6 more
doaj   +1 more source

Computation of Resolvability Parameters for Benzenoid Hammer Graph

open access: yesJournal of Mathematics, 2022
A representation of each vertex of a network into distance-based arbitrary tuple form, adding the condition of uniqueness of each vertex with reference to some settled vertices. Such settled vertices form a set known as resolving set.
Ali Ahmad, Al-Nashri Al-Hossain Ahmad
doaj   +1 more source

A knowledge graph based question answering method for medical domain [PDF]

open access: yesPeerJ Computer Science, 2021
Question answering (QA) is a hot field of research in Natural Language Processing. A big challenge in this field is to answer questions from knowledge-dependable domain.
Xiaofeng Huang   +4 more
doaj   +2 more sources

Stack graphs: Name resolution at scale

open access: yes, 2022
We present stack graphs, an extension of Visser et al.'s scope graphs framework. Stack graphs power Precise Code Navigation at GitHub, allowing users to navigate name binding references both within and across repositories. Like scope graphs, stack graphs encode the name binding information about a program in a graph structure, in which paths represent ...
Creager, Douglas A.   +1 more
openaire   +4 more sources

Graph-based methods for Author Name Disambiguation: a survey

open access: yesPeerJ Computer Science, 2023
Scholarly knowledge graphs (SKG) are knowledge graphs representing research-related information, powering discovery and statistics about research impact and trends. Author name disambiguation (AND) is required to produce high-quality SKGs, as a disambiguated set of authors is fundamental to ensure a coherent view of researchers’ activity.
De Bonis M, Falchi F, Manghi P
openaire   +4 more sources

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets [PDF]

open access: yes, 2016
Graph Signal Processing generalizes classical signal processing to signal or data indexed by the vertices of a weighted graph. So far, the research efforts have been focused on static graph signals.
Grassi, Francesco   +2 more
core   +2 more sources

Topological and Graph-coloring Conditions on the Parameter-independent Stability of Second-order Networked Systems [PDF]

open access: yes, 2017
In this paper, we study parameter-independent stability in qualitatively heterogeneous passive networked systems containing damped and undamped nodes.
Bürger, Mathias   +3 more
core   +2 more sources

On the classification of nonsimple graph C*-algebras [PDF]

open access: yes, 2009
We prove that a graph C*-algebra with exactly one proper nontrivial ideal is classified up to stable isomorphism by its associated six-term exact sequence in K-theory.
C -algebras   +2 more
core   +4 more sources

Home - About - Disclaimer - Privacy