Results 231 to 240 of about 3,234,830 (258)
Some of the next articles are maybe not open access.
NuTrea: Neural Tree Search for Context-guided Multi-hop KGQA
Neural Information Processing Systems, 2023Multi-hop Knowledge Graph Question Answering (KGQA) is a task that involves retrieving nodes from a knowledge graph (KG) to answer natural language questions.
Hyeong Kyu Choi +3 more
semanticscholar +1 more source
Quality and Reliability Engineering International, 2022
Nowadays, the emerging digital technologies and digitalization trend in safety‐critical industrial process systems are bringing great opportunities for system performance improvements.
Chen-Yu Jiang +6 more
semanticscholar +1 more source
Nowadays, the emerging digital technologies and digitalization trend in safety‐critical industrial process systems are bringing great opportunities for system performance improvements.
Chen-Yu Jiang +6 more
semanticscholar +1 more source
Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
RAIRO - Operations Research, 2016Summary: We present in this paper two simple linear algorithms that solve to optimality the linear ordering problem for unweighted tree based graphs \textit{viz}. the oriented trees and the oriented divide-and-conquer graphs.
Alain Quilliot, Djamal Rebaine
openaire +2 more sources
arXiv.org, 2016
We propose a novel tree-like curvilinear structure reconstruction algorithm based on supervised learning and graph theory. In this work we analyze image patches to obtain the local major orientations and the rankings that correspond to the curvilinear ...
Seong-Gyun Jeong +3 more
semanticscholar +1 more source
We propose a novel tree-like curvilinear structure reconstruction algorithm based on supervised learning and graph theory. In this work we analyze image patches to obtain the local major orientations and the rankings that correspond to the curvilinear ...
Seong-Gyun Jeong +3 more
semanticscholar +1 more source
IEEE Transactions on Computational Social Systems
It is crucial to mine latent sentiments and opinions from comments on social media to comprehensively understand people's preferences and experiences.
Wanneng Shu, Cao Zhai, Ke Yu
semanticscholar +1 more source
It is crucial to mine latent sentiments and opinions from comments on social media to comprehensively understand people's preferences and experiences.
Wanneng Shu, Cao Zhai, Ke Yu
semanticscholar +1 more source
Proceedings of the 2000 Third IEEE International Caracas Conference on Devices, Circuits and Systems (Cat. No.00TH8474), 2002
A fundamental problem of symbolic analysis when using the signal flow graph method is to find the common tree of the current and voltage graph (Gi and Gv, respectively), which can be further applied for testing. In this paper we present a novel method in order to determine a common tree of both graphs, which may be used to obtain the symbolic network ...
L.A. Sarmiento-Reyes +2 more
openaire +1 more source
A fundamental problem of symbolic analysis when using the signal flow graph method is to find the common tree of the current and voltage graph (Gi and Gv, respectively), which can be further applied for testing. In this paper we present a novel method in order to determine a common tree of both graphs, which may be used to obtain the symbolic network ...
L.A. Sarmiento-Reyes +2 more
openaire +1 more source
Analog Integrated Circuits and Signal Processing, 2001
A fundamental problem of symbolic analysis of electric networks when using the signal-flow (SFG) graph method is to find the common tree of the current and voltage graph (G_I and G_V, respectively). In this paper we introduce a novel method in order to determine a common tree of both graphs, which may be used to obtain the symbolic network transfer ...
Arturo Sarmiento-Reyes +1 more
openaire +1 more source
A fundamental problem of symbolic analysis of electric networks when using the signal-flow (SFG) graph method is to find the common tree of the current and voltage graph (G_I and G_V, respectively). In this paper we introduce a novel method in order to determine a common tree of both graphs, which may be used to obtain the symbolic network transfer ...
Arturo Sarmiento-Reyes +1 more
openaire +1 more source
Oriented trees in O(k √k)-chromatic digraphs, a subquadratic bound for Burr's conjecture
International Workshop on Graph-Theoretic Concepts in Computer ScienceIn 1980, Burr conjectured that every directed graph with chromatic number $2k-2$ contains any oriented tree of order $k$ as a subdigraph. Burr showed that chromatic number $(k-1)^2$ suffices, which was improved in 2013 to $\frac{k^2}{2} - \frac{k}{2} + 1$
S. Bessy, D. Gonçalves, Amadeus Reinald
semanticscholar +1 more source
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
NetworksChordal graphs are the intersection graphs of subtrees of a tree, while interval graphs of subpaths of a path. Undirected path graphs, directed path graphs and rooted directed path graphs are intermediate graph classes, defined, respectively, as the ...
C. D. de Figueiredo +3 more
semanticscholar +1 more source
Scalable and Safe Multi-Agent Coordination with Reconstructed Level-k Monte Carlo Tree Search
Adaptive Agents and Multi-Agent SystemsMulti-agent coordination without central control requires balancing safety and computational efficiency. We present a novel framework that transforms Level-k cognitive reasoning from a descriptive model of bounded rationality into a constructive planning
Zhi-Hao Lin +4 more
semanticscholar +1 more source

