Results 41 to 50 of about 904,948 (308)

Promise and Limitations of Supervised Optimal Transport-Based Graph Summarization via Information Theoretic Measures

open access: yesIEEE Access, 2023
Graph summarization is the problem of producing smaller graph representations of an input graph dataset, in such a way that the smaller compressed graphs capture relevant structural information for downstream tasks.
Sepideh Neshatfar   +2 more
doaj   +1 more source

Enhancing cybersecurity through autonomous knowledge graph construction by integrating heterogeneous data sources [PDF]

open access: yesPeerJ Computer Science
Cybersecurity plays a critical role in today’s modern human society, and leveraging knowledge graphs can enhance cybersecurity and privacy in the cyberspace.
Hatoon Alharbi   +3 more
doaj   +2 more sources

Incidence Gain Graphs and Generalized Quadrangles [PDF]

open access: green
We demonstrate a construction method based on a gain function that is defined on the incidence graph of an incidence geometry. Restricting to when the incidence geometry is a linear space, we show that the construction yields a generalized quadrangle provided that the gain function satisfies a certain bijective property.
Ryan McCulloch
openalex   +3 more sources

Lattice Points in Orthotopes and a Huge Polynomial Tutte Invariant of Weighted Gain Graphs

open access: yes, 2015
A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain graph is a gain graph with vertex weights from an abelian semigroup, where the gain group is lattice ordered and acts on the weight semigroup.
Forge, David, Zaslavsky, Thomas
core   +3 more sources

Leader Election for Anonymous Asynchronous Agents in Arbitrary Networks [PDF]

open access: yes, 2012
We study the problem of leader election among mobile agents operating in an arbitrary network modeled as an undirected graph. Nodes of the network are unlabeled and all agents are identical.
Dereniowski, Dariusz, Pelc, Andrzej
core   +2 more sources

Accelerating Consensus by Spectral Clustering and Polynomial Filters [PDF]

open access: yes, 2015
It is known that polynomial filtering can accelerate the convergence towards average consensus on an undirected network. In this paper the gain of a second-order filtering is investigated. A set of graphs is determined for which consensus can be attained
Apers, Simon, Sarlette, Alain
core   +7 more sources

Balance in gain graphs – A spectral analysis

open access: yesLinear Algebra and its Applications, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shahul Hameed K, , Germina, K.A.
openaire   +1 more source

Adaptive Linear Programming Decoding of Polar Codes

open access: yes, 2014
Polar codes are high density parity check codes and hence the sparse factor graph, instead of the parity check matrix, has been used to practically represent an LP polytope for LP decoding.
Siegel, Paul H., Taranalli, Veeresh
core   +1 more source

LPG-Based Knowledge Graphs: A Survey, a Proposal and Current Trends

open access: yesInformation, 2023
A significant part of the current research in the field of Artificial Intelligence is devoted to knowledge bases. New techniques and methodologies are emerging every day for the storage, maintenance and reasoning over knowledge bases.
Davide Di Pierro   +2 more
doaj   +1 more source

Analyzing a four quadrant dc-dc Luo converter by means of signal flow graph modeling technique

open access: yesAin Shams Engineering Journal, 2018
In this paper, the signal flow graph technique and Mason gain formula are applied for extracting small signal model and transfer functions from control to output and from input to output.
Ebrahim Babaei   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy