Results 41 to 50 of about 1,424,485 (296)
Directed acyclic graph for the current study.
, 2022 Directed acyclic graph for the current study.
Pamela Machakanja (13149572) +4 more
core +1 more source
On compact directed acyclic word graphs [PDF]
, 1997 The Directed Acyclic Word Graph (DAWG) is a space-efficient data structure to treat and analyze repetitions in a text, especially in DNA genomic sequences. Here, we consider the Compact Directed Acyclic Word Graph of a word. We give the first direct algorithm to construct it. It runs in time linear in the length of the string on a fixed alphabet.
Crochemore, Maxime, Vérin, Renaud
openaire +3 more sources
A Competence-based System for Recommending Study Materials from the Web (CBSR) [PDF]
, 2010 A pedagogically-informed approach to the design of an e-learning system is important since an effective learning system requires teaching activities that match the students’ learning requirements.
Lester Gilbert +5 more
core +2 more sources
ICT Express, 2018 Task scheduling is one of the most important issues in heterogeneous environments when high efficiency is required. Because task scheduling is a Nondeterministic Polynomial (NP)-hard problem, many evolutionary algorithms have been adopted to solve this ...
Negar Dordaie, Nima Jafari Navimipour
doaj +1 more source
Directed acyclic graph for the mediation analysis.
, 2022 Directed acyclic graph for the mediation analysis.
Jison Ki (13020468) +1 more
core +1 more source
Ternary directed acyclic word graphs
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Satoru Miyamoto +3 more
openaire +4 more sources
How to Layer a Directed Acyclic Graph
, 2002 We consider the problem of partitioning a directed acyclic graph into layers such that all edges point unidirectionally. We perform an experimental analysis of some of the existing layering algorithms and then propose a new algorithm that is more ...
Healy, Patrick +3 more
core +1 more source
IEEE Access, 2022 Learning the structure of Bayesian networks is a challenging problem because it is a NP-Hard problem. As an excellent search & score based method, the K2 algorithm strongly depends on the input of global order of all nodes to ensure the result is ...
Kunhua Zhong +3 more
doaj +1 more source
Transformers over Directed Acyclic Graphs
Advances in Neural Information Processing Systems 36, 2023 Transformer models have recently gained popularity in graph representation learning as they have the potential to learn complex relationships beyond the ones captured by regular graph neural networks. The main research question is how to inject the structural bias of graphs into the transformer architecture, and several proposals have been made for ...
Yuankai Luo +2 more
openaire +3 more sources
Optimizing Iterative Data-Flow Scientific Applications Using Directed Cyclic Graphs
IEEE Access, 2023 Data-flow programming models have become a popular choice for writing parallel applications as an alternative to traditional work-sharing parallelism. They are better suited to write applications with irregular parallelism that can present load imbalance.
David Alvarez, Vicenc Beltran
doaj +1 more source