Results 301 to 310 of about 2,245,805 (347)

A Distributed Multi-Agent Reinforcement Learning With Graph Decomposition Approach for Large-Scale Adaptive Traffic Signal Control

IEEE transactions on intelligent transportation systems (Print), 2022
With the emerging connected-vehicle technologies and smart roadways, the need for intelligent adaptive traffic signal controls (ATSC) is more than ever before.
Shan Jiang   +3 more
semanticscholar   +1 more source

DeGNN: Improving Graph Neural Networks with Graph Decomposition

Knowledge Discovery and Data Mining, 2021
Mining from graph-structured data is an integral component of graph data management. A recent trending technique, graph convolutional network (GCN), has gained momentum in the graph mining field, and plays an essential part in numerous graph-related ...
Xupeng Miao   +19 more
semanticscholar   +1 more source

Comprehensive Image Captioning via Scene Graph Decomposition

European Conference on Computer Vision, 2020
We address the challenging problem of image captioning by revisiting the representation of image scene graph. At the core of our method lies the decomposition of a scene graph into a set of sub-graphs, with each sub-graph capturing a semantic component ...
Yiwu Zhong   +4 more
semanticscholar   +1 more source

Core Graph Decomposition

Encyclopedia of Social Network Analysis and Mining. 2nd Ed., 2018

semanticscholar   +2 more sources

The policy graph decomposition of multistage stochastic programming problems

Networks, 2020
We propose the policy graph as a structured way of formulating a general class of multistage stochastic programming problems in a way that leads to a natural decomposition. We also propose an extension to the stochastic dual dynamic programming algorithm
Oscar Dowson
semanticscholar   +1 more source

Graph Decomposition of Slim Graphs

Graphs and Combinatorics, 1999
Let \(H\) be a fixed graph. An \(H\)-decomposition of an input graph \(G\) is a partition of the edge set of \(G\) such that each part forms a subgraph isomorphic to \(H\). This problem is known to be NP-complete as soon as \(H\) has a component with at least three edges. (This was conjectured by Holyer, and proved independently by \textit{D. Dor} and \
Caro, Yair, Yuster, Raphael
openaire   +2 more sources

Cores matter? An analysis of graph decomposition effects on influence maximization problems

Web Science Conference, 2020
Estimating the spreading potential of nodes in a social network is an important problem which finds application in a variety of different contexts, ranging from viral marketing to spread of viruses and rumor blocking.
A. Calio, Andrea Tagarelli, F. Bonchi
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy