Results 11 to 20 of about 1,372,330 (300)

Knowledge Graphs: Opportunities and Challenges [PDF]

open access: yesArtificial Intelligence Review, 2023
With the explosive growth of artificial intelligence (AI) and big data, it has become vitally important to organize and represent the enormous volume of knowledge appropriately.
Ciyuan Peng   +3 more
semanticscholar   +1 more source

Strong Perfect Cobondage Number of Standard Graphs

open access: yesRatio Mathematica, 2023
Let G be a simple graph. A subset S Í V(G) is called a strong (weak) perfect dominating set of G if |Ns(u) ∩ S| = 1(|Nw(u) ∩ S| = 1) for every u ∊V(G) - S where Ns(u) = {v ∊ V(G) / uv  deg v ≥ deg u} (Nw(u) = {v ∊V(G) / uv  deg v ≤ deg u}.
T. S Govindalakshmi, N Meena
doaj   +1 more source

A Survey on Knowledge Graphs: Representation, Acquisition, and Applications [PDF]

open access: yesIEEE Transactions on Neural Networks and Learning Systems, 2020
Human knowledge provides a formal understanding of the world. Knowledge graphs that represent structural relations between entities have become an increasingly popular research direction toward cognition and human-level intelligence.
Shaoxiong Ji   +4 more
semanticscholar   +1 more source

Influence of the tie-break rule on the end-vertex problem [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976.
Pierre Charbit   +2 more
doaj   +1 more source

On interval number in cycle convexity [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2018
Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph convexity parameter called hull number for this new graph convexity they proposed, and they ...
Julio Araujo   +3 more
doaj   +1 more source

Innovation in regional graphics (and academic communication)

open access: yesRegional Studies, Regional Science, 2022
This editorial explores the importance and power of regional graphics for communication in both academia and practice. This journal regularly publishes regional graphics, which feature one or a series of visualizations accompanied by short text that ...
Jen Nelles, Kevin Walsh, Elvis Nyanzu
doaj   +1 more source

Improving the adversarial transferability with relational graphs ensemble adversarial attack

open access: yesFrontiers in Neuroscience, 2023
In transferable black-box attacks, adversarial samples remain adversarial across multiple models and are more likely to attack unknown models. From this view, acquiring and exploiting multiple models is the key to improving transferability.
Jiatian Pi   +5 more
doaj   +1 more source

Process, Analyze and Visualize Telecommunication Network Configuration Data in Graph Database [PDF]

open access: yesVietnam Journal of Computer Science, 2020
In network telemetry systems, nodes produce vast number of configuration files based on how they are configured. Steps were taken to process these files into databases to help the work of the developers, testers and customer support to focus on the ...
Péter Lehotay-Kéry, Attila Kiss
doaj   +1 more source

The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains [PDF]

open access: yesIEEE Signal Processing Magazine, 2012
In applications such as social, energy, transportation, sensor, and neuronal networks, high-dimensional data naturally reside on the vertices of weighted graphs.
D. Shuman   +4 more
semanticscholar   +1 more source

Constructive Graph Tasks in Distant Contests

open access: yesInformatics in Education, 2020
The paper discusses a certain type of competitions based on distance interaction of a participant with simulation models of concepts from discrete mathematics and computer science.
Ilya POSOV   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy