We give algorithms for geometric graph problems in the modern parallel models such as MapReduce. For example, for the Minimum Spanning Tree (MST) problem over a set of points in the two-dimensional ...
A holy grail of theoretical computer science, with numerous fundamental implications to more applied areas of computing such as operations research and artificial intelligence, is the question of ...
Abstract: This paper introduces a novel method that integrates structural information with training deep neural models to solve math word problems. Prior works adopt the graph structure to represent ...
Abstract: In this paper we propose a graph cut method for solving a multi-label linear inverse problem with an arbitrary system matrix. Graph cuts are efficient methods for solving pixel-labeling and ...
conda create -y -n ipmgnn python=3.10 conda activate ipmgnn conda install pytorch==2.0.0 pytorch-cuda=11.8 -c pytorch -c nvidia conda install pyg -c pyg pip install ...
An exciting avenue of neuroscientific research involves quantifying the time-varying properties of functional connectivity networks. As a result, many methods have been proposed to estimate the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results