Dependency graph

About: Dependency graph is a research topic. Over the lifetime, 1836 publications have been published within this topic receiving 32273 citations.

A Shortest Path Dependency Kernel for Relation Extraction

Abstract: We present a novel approach to relation extraction, based on the observation that the information required to assert a relationship between two named entities in the same sentence is typically captured by the shortest path between the two entities in the dependency graph. Experiments on extracting top-level relations from the ACE (Automated Content Extraction) newspaper corpus show that the new shortest path dependency kernel outperforms a recent approach based on dependency tree kernels.

Algorithms for acyclic database schemes

Abstract: Many real-world situations can be captured by a set of functional dependencies and a single join dependency of a particular form called acyclic [B..]. The join dependency corresponds to a natural decomposition into meaningfull objects (an acyclic database scheme). Our purpose in this paper is to describe efficient algorithms in this setting for various problems, such as computing projections, minimizing joins, inferring dependencies, and testing for dependency satisfaction.

An efficient algorithm for projective dependency parsing

Abstract: This paper presents a deterministic parsing algorithm for projective dependency grammar. The running time of the algorithm is linear in the length of the input string, and the dependency graph produced is guaranteed to be projective and acyclic. The algorithm has been experimentally evaluated in parsing unrestricted Swedish text, achieving an accuracy above 85% with a very simple grammar.

Deadlock-free adaptive routing in multicomputer networks using virtual channels

Abstract: The use of adaptive routing in a multicomputer interconnection network improves network performance by using all available paths and provides fault tolerance by allowing messages to be routed around failed channels and nodes. Two deadlock-free adaptive routing algorithms are described. Both algorithms allocate virtual channels using a count of the number of dimension reversals a packet has performed to eliminate cycles in resource dependency graphs. The static algorithm eliminates cycles in the network channel dependency graph. The dynamic algorithm improves virtual channel utilization by permitting dependency cycles and instead eliminating cycles in the packet wait-for graph. It is proved that these algorithms are deadlock-free. Experimental measurements of their performance are presented. >

Real time network policy checking using header space analysis

Abstract: Network state may change rapidly in response to customer demands, load conditions or configuration changes But the network must also ensure correctness conditions such as isolating tenants from each other and from critical services Existing policy checkers cannot verify compliance in real time because of the need to collect "state" from the entire network and the time it takes to analyze this state SDNs provide an opportunity in this respect as they provide a logically centralized view from which every proposed change can be checked for compliance with policy But there remains the need for a fast compliance checker Our paper introduces a real time policy checking tool called NetPlumber based on Header Space Analysis (HSA) [8] Unlike HSA, however, NetPlumber incrementally checks for compliance of state changes, using a novel set of conceptual tools that maintain a dependency graph between rules While NetPlumber is a natural fit for SDNs, its abstract intermediate form is conceptually applicable to conventional networks as well We have tested NetPlumber on Google's SDN, the Stanford backbone and Internet 2 With NetPlumber, checking the compliance of a typical rule update against a single policy on these networks takes 50-500µs on average