This paper proposes a holistic lexicon-reduction method for ancient and modern handwritten Arabic documents. The word shape is represented by the weighted topological signature vector (W-TSV), which encodes graph data into a low-dimensional vector space. Three directed acyclic graph (DAG) representations are proposed for Arabic word shapes, based on topological and geometrical features. Lexicon...

We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and obtain a marginally improved complexity result over the previously known O(||δ||log||δ||). In addition, we provide an empirical comparison against three existing solutions using random DAG’s. The results show our algorithm to out pe...

This paper discusses a hierarchical scheduling framework to reduce the complexity of scheduling synchronous dataflow (SDF) graphs onto multiple processors. The core of this framework is a clustering algorithm that reduces the number of nodes before expanding the SDF graph into a precedence DAG (directed acyclic graph). The internals of the clusters are then scheduled with uniprocessor SDF sched...

Revised June 11, 1989 E.R. Gansner S.C. North K.P. Vo AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT dag is a pic or POSTSCRIPT preprocessor that draws directed graphs. It works well on acyclic graphs and other graphs that can be drawn as hierarchies. Graph descriptions contain nodes, edges, and optional control statements. Here is a drawing of a graph from Forrester’s book, Worl...

In this paper we discuss a hierarchical scheduling framework to reduce the complexity of scheduling synchronous dataflow (SDF) graphs onto multiple processors. The core of this framework is a clustering technique that reduces the number of actors before expanding the SDF graph into an directed acyclic graph (DAG). The internals of the clusters are then scheduled with uniprocessor SDF schedulers...

In this thesis we describe subclasses of a class of graphs with three types of edges, called loopless mixed graphs (LMGs). The class of LMGs contains almost all known classes of graphs used in the literature of graphical Markov models. We focus in particular on the subclass of ribbonless graphs (RGs), which as special cases include undirected graphs, bidirected graphs, and directed acyclic grap...

The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and semantic caching [24, 10, 12]. This paper studies a specific instance of this problem, where the queried data has the shape of a DAG (Directed Acyclic Graph) and the query language uses DAG patterns to retrieve portions o...

We consider approaches that allow task migration for scheduling recurrent directed-acyclic-graph (DAG) tasks on symmetric, shared-memory multiprocessors (SMPs) in order to meet a given throughput requirement with fewer processors. Within the scheduling approach proposed, we present a heuristic based on grouping DAG subtasks for lowering the end-to-end latency and an algorithm for computing an u...

We consider the PC-algorithm ([13]) for estimating the skeleton of a very high-dimensional acyclic directed graph (DAG) with corresponding Gaussian distribution. The PC-algorithm is computationally feasible for sparse problems with many nodes, i.e. variables, and it has the attractive property to automatically achieve high computational efficiency as a function of sparseness of the true underly...

Aiming to solve the problems of big combination number of possible events and high memory consumption and low detection efficiency during the detection process of Naive method for multi-probability RFID event streams, a new complex event detection method based on NFA-DAG (Nondeterministic Finite Automaton-Directed Acyclic Graph) is presented for multi-probability RFID event stream in this paper...