Skip to search formSkip to main contentSkip to account menu

Dependency relation

Known as: Reliance alphabet, Concurrent alphabet, Dependency 
In mathematics and computer science, a dependency relation is a binary relation that is finite, symmetric, and reflexive; i.e. a finite tolerance… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Computer scienceDependency grammarFree monoidHistory monoid

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Mumpitz at PARSEME Shared Task 2018: A Bidirectional LSTM for the Identification of Verbal Multiword Expressions
In this paper, we describe Mumpitz, the system we submitted to the PARSEME Shared task on automatic identification of verbal… 
2013
2013
Optimization of Underground Stope with Network Flow Method
RESUME La these presente une serie d'algorithmes originaux visant a optimiser la geometrie de chantiers souterrains en 3D… 
2013
2013
Bypassing Cloud Providers' data validation to store arbitrary data
A fundamental Software-as-a-Service (SaaS) characteristic in Cloud Computing is to be application-specific; depending on the… 
2011
2011
WORL: A Web Ontology Rule Language
We develop a Web ontology rule language, called WORL, which combines a variant of OWL 2 RL with eDatalog-with-negation. We… 
2010
2010
Supertags as Source Language Context in Hierarchical Phrase-Based SMT
Statistical machine translation (SMT) models have recently begun to include source context modeling, under the assumption that… 
2005
2005
A novel min-process checkpointing scheme for mobile computing systems
2005
2005
Recursive Object-Oriented Modules
ML-style modules and classes are complementary. The former are better at structuring and genericity, the latter at extension and… 
2001
2001
Resolving Ambiguity in Inter-chunk Dependency Parsing
Recently, dependency grammar has become quite popular in relatively free word-order languages. We encounter many structural… 
1998
1998
A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract)
The purpose of partial-order reduction techniques is to avoid exploring several interleavings of independent transitions when… 
1991
1991
Invariant Semantics of Nets with Inhibitor Arcs
We here discuss an invariant semantics of concurrent systems which is a generalisation of the causal partial order (CPO… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)