Results 21 to 30 of about 112,189 (262)

Computing Planarity in Computable Planar Graphs

open access: yesGraphs and Combinatorics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar Levin, Taylor McMillan
openaire   +3 more sources

Enabling Model-Based LTI for Large-Scale Power System Security Monitoring and Enhancement With Graph-Computing-Based Power Flow Calculation

open access: yesIEEE Access, 2019
The voltage stability is an essential security concern when a system is operating in peak load hours or subjected to an N-1 contingency. Among various voltage stability indices, Local Thevenin Index (LTI) has been a popular one, but mostly applied to the
Qingxin Shi   +6 more
doaj   +1 more source

Privacy-Preserving Outsourced Computation Scheme for Accurate Shortest Distance of Graph Data [PDF]

open access: yesJisuanji gongcheng, 2023
The widely used massive graph data, such as the ones used for social networks, communication networks, and bioproteins, contain large amount of private and sensitive personal and commercial information; therefore, it is essential to encrypt such graph ...
Yingying YU, Hongfa DING, Heling JIANG
doaj   +1 more source

ZenLDA: Large-Scale Topic Model Training on Distributed Data-Parallel Platform

open access: yesBig Data Mining and Analytics, 2018
Recently, topic models such as Latent Dirichlet Allocation (LDA) have been widely used in large-scale web mining. Many large-scale LDA training systems have been developed, which usually prefer a customized design from top to bottom with sophisticated ...
Bo Zhao   +3 more
doaj   +1 more source

Effective Computation of a Feedback Arc Set Using PageRank

open access: yesJournal of Graph Algorithms and Applications, 2023
Computing a minimum Feedback Arc Set (FAS) is important for visualizing directed graphs in hierarchical style. It is the first step of both known frameworks for hierarchical graph drawing of directed graphs and it is NP-hard.
Vasileios Geladaris   +2 more
doaj   +1 more source

Inter-Satellite Cooperative Computing Scheme Driven by Business Graph in LEO Satellite Network

open access: yes天地一体化信息网络, 2021
Low earth orbit-satellite network (LEO-SN) has the advantages of wide coverage and short satellite-to-earth link, and has become a current hot research fi eld.A business graph-driven inter-satellite collaborative computing method in LEO-SN was proposed ...
Xiaobo GUO   +3 more
doaj   +2 more sources

On computing graph closures [PDF]

open access: yesInformation Processing Letters, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Computing semantic similarity of texts based on deep graph learning with ability to use semantic role label information

open access: yesScientific Reports, 2022
We propose a deep graph learning approach for computing semantic textual similarity (STS) by using semantic role labels generated by a Semantic Role Labeling (SRL) system. SRL system output has significant challenges in dealing with graph-neural networks
Majid Mohebbi   +2 more
doaj   +1 more source

Sufficient Networks for Computing Support of Graph Patterns

open access: yesInformation, 2023
Graph mining is the process of extracting and analyzing patterns from graph data. Graphs are a data structure that consists of a set of nodes and a set of edges that connect these nodes.
Natalia Vanetik
doaj   +1 more source

Computability of Generalized Graphs [PDF]

open access: yesMathematics
We investigate conditions under which a semicomputable set is computable. In particular, we study topological pairs (A,B) which have a computable type, which means that in any computable topological space, a semicomputable set S is computable if there exists a semicomputable set T such that (S,T) is homeomorphic to (A,B).
Zvonko Iljazović, Matea Jelić
openaire   +3 more sources

Home - About - Disclaimer - Privacy