• Aucun résultat trouvé

[PDF] Top 20 Relational and graph queries over a transition system

Has 10000 "Relational and graph queries over a transition system" found on our website. Below are the top 20 most common "Relational and graph queries over a transition system".

Relational and graph queries over a transition system

Relational and graph queries over a transition system

... is a brute force traversal of all possible model states that permits to assert if a property is satisfied or ...produces a counterexample trace. However, once the existence of a problem is ... Voir le document complet

7

On the Optimization of Recursive Relational Queries: Application to Graph Queries

On the Optimization of Recursive Relational Queries: Application to Graph Queries

... propose a variation of the classical relational algebra extended with a fixpoint operator, which is useful for captur- ing recursive terms and for facilitating their ...compatible and ... Voir le document complet

24

On the Optimization of Recursive Relational Queries: Application to Graph Queries

On the Optimization of Recursive Relational Queries: Application to Graph Queries

... When a fixpoint µ(X = κ ∪ ψ ) is such that X appears ex- actly once in ψ , which is always the case for terms generated by translating a UCRPQ, this fixpoint can be translated into a CREATE RECURSIVE ... Voir le document complet

24

Computation of Extended Answers to Relational Database Queries

Computation of Extended Answers to Relational Database Queries

... nodes, and the links between foreign keys and primary keys correspond to directed edges between ...data and meta-data to cover the whole of the ...– and can be tested 1 – over versions ... Voir le document complet

51

Adaptive Join Operator for Federated Queries over Linked Data Endpoints

Adaptive Join Operator for Federated Queries over Linked Data Endpoints

... time and completion time include commu- nication time, I/O time and CPU ...Quilitz and Leser [ 4 ], Gortlitz and Staab [ 5 ] and Wang et ...time and uses statistics to estimate ... Voir le document complet

17

A Transition-Based System for Joint Lexical and Syntactic Analysis

A Transition-Based System for Joint Lexical and Syntactic Analysis

... as a flat subtree of the syntactic ...MWE, and all the other elements are attached to this root with dependencies having special la- ...structures and may confuse a syntactic ...MWE and ... Voir le document complet

12

On-line relational and multiple relational SOM

On-line relational and multiple relational SOM

... data and a standard SOM: these maps are supposed to preserve the topographic properties of all three sorts of data, which is a harder task than preserving the topographic property of only one sort ... Voir le document complet

41

Bond Graph Modeling and Simulation of a Vibration Absorber System in Helicopters

Bond Graph Modeling and Simulation of a Vibration Absorber System in Helicopters

... 11.4.1 Modeling Assumptions of the Vibration Absorber Suspension The 3D vibration absorber suspension is a set of 14 rigid bodies the MGB, four MGB bars, four SARIB beaters, four interme[r] ... Voir le document complet

44

On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules

On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules

... establishing a matching E XP T IME lower ...generated a lot of interest in the last years as a promising way of facilitating access to data (see [4] for a recent ...define a conceptual ... Voir le document complet

17

Efficient Enumeration for Conjunctive Queries over X-underbar Structures

Efficient Enumeration for Conjunctive Queries over X-underbar Structures

... variables and every X-structure S, T (S) can be enumerated with a preprocessing O(|T |·|D| 2 ) and a delay in ...structure over binary pred- icates (if we remove the computation of ... Voir le document complet

22

Continuous Top-k Queries over Real-Time Web Streams

Continuous Top-k Queries over Real-Time Web Streams

... has a minimal impact on the total item score and only a small number of queries will be updated by the corresponding target items of incoming ...0.2 and then exhibits a constant ... Voir le document complet

24

Decibel: the relational dataset branching system

Decibel: the relational dataset branching system

... in a new version. In update-heavy environments, this could result in a large number of versions, most of which are unlikely to be of interest to the users as logical ...creating a new version that ... Voir le document complet

13

Answering Conjunctive Regular Path Queries over Guarded Existential Rules

Answering Conjunctive Regular Path Queries over Guarded Existential Rules

... is a match of q in P = ((V, E), T ...atom and its ...is a match of q in ...whether a given proof scheme is ...chase graph and an an- cestor atom can be computed using the ... Voir le document complet

8

The SPARQLGX System for Distributed Evaluation of SPARQL Queries

The SPARQLGX System for Distributed Evaluation of SPARQL Queries

... LUBM queries, SPARQLGX and 4store constitute the fastest ...LUBM queries by their graph variables (introduced in Table 3) in Figure 4 to represent time distributions for each store, excluding ... Voir le document complet

15

Bond Graph Based Stability Analysis of a Railway Traction System

Bond Graph Based Stability Analysis of a Railway Traction System

... is a contribution showing how the Bond Graph formalism is useful for modelling and analysing electrical engineering multi-field ...obtaining a homogeneous modelling greatly facilitates the ... Voir le document complet

21

Bond Graph Multi-time Scale Analysis of a Railway Traction System

Bond Graph Multi-time Scale Analysis of a Railway Traction System

... effort) and displacement q (integral of ...effort and flow, where the product gives the transmitted ...Bond graph elements can be classified in 3 categories : passive elements, active elements, ... Voir le document complet

10

On the minimum size of an identifying code over all orientations of a graph

On the minimum size of an identifying code over all orientations of a graph

... For a graph G, we define id(G) as the minimum size of an identifying code of G if one exists, and id(G) = +∞ ...if and only if G is ...[19] and have been applied to problems such as ... Voir le document complet

24

GenoLink: a graph-based querying and browsing system for investigating the function of genes and proteins

GenoLink: a graph-based querying and browsing system for investigating the function of genes and proteins

... such a network can be modelled as a graph. A graph is defined by two sets (V,E) where V is a set of vertices and E is a set of ...edges. A vertex represents ... Voir le document complet

12

Laminar to turbulent transition over a rotor at low reynolds numbers

Laminar to turbulent transition over a rotor at low reynolds numbers

... topology and performance of a rotor operating at low Reynolds numbers is ...turbulent transition experiments over small rotors is ...force and torque measurements were used to study ... Voir le document complet

11

Alpage: Transition-based semantic graph parsing with syntactic features

Alpage: Transition-based semantic graph parsing with syntactic features

... different transition-based parsers, which have finally converged on several ...to a word, it is necessary to clearly dissociate the addition of a dependency from the reduction of a word ... Voir le document complet

8

Show all 10000 documents...