• DAGuE

• Referenced in 11 articles [sw20709]
• Direct Acyclic Graph of tasks with labeled edges designating data dependencies. DAGs are represented...
• subgraph2vec

• Referenced in 4 articles [sw36496]
• Deep Learning and Graph Kernels. These latent representations encode semantic substructure dependencies in a continuous ... easily exploited by statistical models for tasks such as graph classification, clustering, link prediction...
• struc2vec

• Referenced in 14 articles [sw36495]
• different scales, and constructs a multilayer graph to encode structural similarities and generate structural context ... struc2vec exhibits much superior performance in this task, as it overcomes limitations of prior approaches ... that struc2vec improves performance on classification tasks that depend more on structural identity...
• azove

• Referenced in 13 articles [sw04634]
• present a novel approach for these tasks which consists of an $output-sensitive$ algorithm ... graph. The size of a BDD is the number of nodes of its graph ... heavily depends on the chosen variable ordering. Finding the optimal variable ordering...
• Shimba

• Referenced in 6 articles [sw01242]
• slice the static dependency graphs produced by Rigi. In turn, Rigi graphs are used ... views enables goal-driven reverse engineering tasks and aids the overall understanding of the target...
• persona2vec

• Referenced in 1 article [sw33469]
• performance in many graph mining tasks. Most existing embedding algorithms assign a single vector ... different roles depending on the contexts. Here, we propose persona2vec, a graph embedding framework that ... performance in many graph mining tasks. Most existing embedding algorithms assign a single vector ... different roles depending on the contexts. Here, we propose persona2vec, a graph embedding framework that...
• HTGviz

• Referenced in 1 article [sw23529]
• Graph (HTG) program representation where task parallelism is represented by precedence relations (arcs) among task ... information about data/control dependences and task precedences. It allows to tune task partitioning and parallelism ... OpenMP directives into the code based on graph manipulation facilities. HTGviz also guides the user...
• GraphState

• Referenced in 2 articles [sw21498]
• form that depends only on its combinatorial type. The uniqueness of graph representation gives ... finding, searching for subgraphs and other graph manipulation tasks. Though offered libraries were originally designed...
• CloneDifferentiator

• Referenced in 1 article [sw26893]
• correctly interpret cloning information and perform maintenance tasks on clones. Manual analysis of semantic differences ... clone detector by differentiating Program Dependence Graphs (PDGs) of clones. CloneDifferentiator is able to provide ... effective means of analyzing clones in a task oriented manner...
• COLIN

• Referenced in 6 articles [sw27480]
• linear change, and the handling of duration-dependent effects in combination with duration inequalities, both ... extension of the temporal relaxed planning graph heuristic of CRIKEY3, to support reasoning directly with ... continuous change. We extend the range of task variables considered to be suitable candidates...
• CIRFE

• Referenced in 3 articles [sw27640]
• capability sensors and where each sensor is tasked with estimating some local components ... given by a time-varying possibly sparse graph. Under minimal conditions, on the interagent communication ... dependencies of the component wise asymptotic covariance in terms of the number of agents tasked...
• Skip RNN

• Referenced in 1 article [sw36445]
• show outstanding performance in sequence modeling tasks. However, training RNNs on long sequences often face ... gradients and difficulty in capturing long term dependencies. In backpropagation through time settings, these issues ... tightly coupled with the large, sequential computational graph resulting from unfolding the RNN in time ... shortens the effective size of the computational graph. This model can also be encouraged...
• DeepTMA

• Referenced in 2 articles [sw33597]
• Effective Contention Models for Network Calculus using Graph Neural Networks. Network calculus computes ... complex dependency structures and finding the tightest delay bounds becomes a resource intensive task ... this paper is a novel framework combining graph-based deep learning and Network Calculus...
• gSkeletonClu

• Referenced in 3 articles [sw30861]
• Agglomeration. Community detection is an important task for mining the structure and function of complex ... overcome this difficulty. However, it depends on a sensitive parameter: minimum similarity threshold ... density-based network clustering algorithm, called gSkeletonClu (graph-skeleton based clustering). By projecting a network...
• Parsl

• Referenced in 3 articles [sw28682]
• allow Parsl to construct a dynamic dependency graph of components that it can then execute ... nodes, and process upward of 1200 tasks per second. Other Parsl features simplify the construction...
• ODEA

• Referenced in 3 articles [sw07671]
• introduce a new modelling technique called arc dependences. It generalizes the traditional notion of disjointness ... specially constructed abstractions of the input graph, comprising significantly less data without losing the essence ... this model lies on paths in the graph, we also investigate an alternative featuring ... strengthening the latter. Behind all these tasks, the combinatorial core engine of the solver...
• CONN

• Referenced in 3 articles [sw26510]
• windowing of the residual blood oxygen level-dependent (BOLD) contrast signal, first-level estimation ... analysis for resting state as well as task-related data. Compared to methods that rely ... bivariate/multivariate regression analysis for multiple ROI sources, graph theoretical analysis, and novel voxel-to-voxel...
• Sub2vec

• Referenced in 1 article [sw41562]
• such as community detection which are intuitively dependent on subgraphs. Here, we formulate subgraph embedding ... network mining tasks, like community detection and graph classification. We show that Sub2Vec gets significant...
• Noodle

• Referenced in 1 article [sw26944]
• dependence constraints between tasks, their arbitrary sizes, and bounded resources available for execution, optimal task ... assigns task priorities. We conduct an extensive experimental to validate Noodle for task graphs taken...
• PLplot

• Referenced in 2 articles [sw07488]
• creating scientific plots. To help accomplish that task it is organized as a core ... plots, bar charts and pie charts. Multiple graphs (of the same or different sizes ... writing a small number of device dependent routines. PLplot is free software primarily licensed under...