Results 261 to 270 of about 22,888 (290)
Some of the next articles are maybe not open access.
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
A distance metric between directed weighted graphs [PDF]
52nd IEEE Conference on Decision and Control, 2013 Directed weighted graphs are increasingly used to model complex systems and interactions, such as networks of interconnected physical or biological subsystems. The analysis of these graphs often requires some form of dissimilarity, or distance measure to compare graphs.
Yunwen Xu +2 more
exaly +2 more sources
Topological orderings of weighted directed acyclic graphs [PDF]
Information Processing Letters, 2016 Included an addendum remarking on an independent proof of one of our main theorems; added references; corrected ...
Daniel Gerbner +2 more
exaly +4 more sources
On the Complexity of a Linear Ordering of Weighted Directed Acyclic Graphs
Moscow University Mathematics Bulletin, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shchekalev, M. I. +2 more
exaly +3 more sources
Unit dual quaternion directed graphs, formation control and general weighted directed graphs
Discrete Applied MathematicsWe study the multi-agent formation control problem in a directed graph. The relative configurations are expressed by unit dual quaternions (UDQs). We call such a weighted directed graph a unit dual quaternion directed graph (UDQDG). We show that a desired relative configuration scheme is reasonable or balanced in a UDQDG if and only if the dual ...
Liqun Qi, Chunfeng Cui, Chen Ouyang
exaly +3 more sources
Finding popular branchings in vertex-weighted directed graphs
Theoretical Computer Science, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kei Natsui, Kenjiro Takazawa
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
Neural Network for Routing in a Directed and Weighted Graph
2008 Eighth International Conference on Intelligent Systems Design and Applications, 2008In this paper, we use a neural network based algorithm to find the best path in a directed and weighted graph. In this algorithm, we define a suitable energy function; the minimum of this function correspond to the best path. By using gradient descent method, the energy is minimized at the convergence of neural network.
Mehran Ghaziasgar, Armin Tavakoli Naeini
openaire +1 more source
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, Daniel J Stilwell
exaly +2 more sources
Subgraph Mining on Directed and Weighted Graphs
2010Subgraph mining algorithms aim at the detection of dense clusters in a graph In recent years many graph clustering methods have been presented Most of the algorithms focus on undirected or unweighted graphs In this work, we propose a novel model to determine the interesting subgraphs also for directed and weighted graphs We use the method of density ...
Stephan Günnemann, Thomas Seidl 0001
openaire +1 more source