Results 231 to 240 of about 35,359 (261)
Inferred global dense residue transition graphs from primary structure sequences enable protein interaction prediction via directed graph convolutional neural networks. [PDF]
Front BioinformEbeid IA, Tang H, Gu P.
europepmc +1 more source
Graph-Enhanced Management-Context-Aware Multi-Step Forecasting of Hourly Sensor-Derived Physiological and Behavioral Indicators in Hu Sheep. [PDF]
Animals (Basel)Wang M, Gu Z.
europepmc +1 more source
Test-retest reliability of meta analytic networks during naturalistic viewing. [PDF]
PLoS OneKröll JP +13 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Packing rooted directed cuts in a weighted directed graph
Mathematical Programming, 1974A simple algorithm is described for constructing a maximum packing of cuts directed away from a distinguished vertex, called the root, in a directed graph, each of whose edges has a nonnegative weight, and it is shown that the maximum packing value is equal to the weight of a minimum-weight spanning arborescence directed away from the root.
exaly +3 more sources
Consensus Seeking Over Random Weighted Directed Graphs
IEEE Transactions on Automatic Control, 2007We examine the consensus problem for a group of agents that communicate via a stochastic information network. Communication among agents is modeled as a weighted directed random graph that switches periodically. The existence of any edge is probabilistic and independent from the existence of any other edge.
Maurizio Porfiri, Dan Stilwell
exaly +2 more sources
Directional Graph Networks with Hard Weight Assignments
2020 25th International Conference on Pattern Recognition (ICPR), 2021Point cloud analysis is an important field for 3D scene understanding. It has applications in self driving cars and robotics (via LIDAR sensors), 3D graphics, and computer-aided design. Neural networks have recently achieved strong results on point cloud analysis problems such as classification and segmentation.
Miguel Domínguez, Raymond W. Ptucha
openaire +1 more source
2005
Weighted Directed Word Graph is a new text-indexing structure which is based on a new compaction method on DAWG. WDWGs are basically cyclic, means that they may accept infinite strings. But by assigning weights to the edges, the acceptable strings are limited only to the substrings of input strings.
Meng Zhang 0006 +3 more
openaire +1 more source
Weighted Directed Word Graph is a new text-indexing structure which is based on a new compaction method on DAWG. WDWGs are basically cyclic, means that they may accept infinite strings. But by assigning weights to the edges, the acceptable strings are limited only to the substrings of input strings.
Meng Zhang 0006 +3 more
openaire +1 more source
Fast Approximated Betweenness Centrality of Directed and Weighted Graphs
2018Node betweenness centrality is a reference metric to identify the most critical spots of a network. However, its exact computation exhibits already high (time) complexity on unweighted, undirected graphs. In some domains such as transportation, weighted and directed graphs can provide more realistic modeling, but at the cost of an additional ...
Angelo Furno +3 more
openaire +1 more source