• Aucun résultat trouvé

Documents and Queries Representation

A Conceptual Representation of Documents and Queries for Information Retrieval Systems by Using Light Ontologies

A Conceptual Representation of Documents and Queries for Information Retrieval Systems by Using Light Ontologies

... Conceptual Representation and Indexing In traditional IR systems, documents are indexed by single ...ambiguity and the limited ex- pressiveness of single ...of documents, the task of ...

47

Aggregate Queries for Discrete and Continuous Probabilistic XML

Aggregate Queries for Discrete and Continuous Probabilistic XML

... XML documents and the uni- fying representation model of p-documents [2, ...nodes), and determinis- tic (all nodes ...For queries, we consider tree-pattern queries ...

13

DSRIM: A Deep Neural Information Retrieval Model Enhanced by a Knowledge Resource Driven Representation of Documents

DSRIM: A Deep Neural Information Retrieval Model Enhanced by a Knowledge Resource Driven Representation of Documents

... spectively) and large-scale knowledge graphs ...concepts) and their associated relations ...between queries and documents through query expansion [25, 36] or document expansion ...

11

Backward Type Inference for XML Queries

Backward Type Inference for XML Queries

... 2 and () , is unsatisfiable, ...2 and ρ is incompatible with every constraint-set inferred from e 2 and () , ...empty and a non-empty sequence depending on the value of $v. The first and ...

32

Compact preference representation and combinatorial vote

Compact preference representation and combinatorial vote

... As soon as variables are not preferentially independent, it is generally a bad idea to decompose a combinatorial vote problem with p variables into a set of p smaller problems, each one bearing on a single variable: ...

15

Possible and Certain Answers for Queries over Order-Incomplete Data

Possible and Certain Answers for Queries over Order-Incomplete Data

... possible and certain answers ...input and in intermediate results, we should present it to the user, who can then browse through the ordered query results (as is typically done in absence of uncertainty, ...

56

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams

... space and preprocessing time are O(n 1+ε ) and the query time is O(2 1/ε log n), proving Theorem ...proximity queries requires the manipulation of binary trees with topology determined by a Voronoi ...

18

Compact preference representation and Boolean games

Compact preference representation and Boolean games

... form and normal form, which coincide as far as static games are concerned), utility functions are usually represented explicitly, by listing the values for each combination of strategies (an exception being the ...

51

La gestion électronique des documents et la réédition de documents informatisés

La gestion électronique des documents et la réédition de documents informatisés

... J'ai pu ainsi trouver les descripteurs specifiques qui me permirent de commencer la recherche sur les differents supports accessibles (Intemet, Dialog...). Cette technologie remontant a[r] ...

21

Efficient Evaluation of Parameterized Pattern Queries

Efficient Evaluation of Parameterized Pattern Queries

... value and x is a variable, the parame- terized pattern ...preceded and followed by the same ...expressive and flexible querying framework because the presence of variables offers many op- portunities ...

8

Graphical Models: Queries, Complexity, Algorithms

Graphical Models: Queries, Complexity, Algorithms

... transform and bounded precision description of real numbers) to ...acids and each choice in this alphabet is defined by the combination of a fixed “backbone” part and a variable side-chain, a highly ...

23

Semantic Optimization of Conjunctive Queries

Semantic Optimization of Conjunctive Queries

... case, and it has been shown to be ...initiate and develop the theory of semantic optimization of CQs under ...CQ and a set of constraints, is the query semantically in GHW k , for a fixed k ≥ 1, ...

61

Boundedness of Conjunctive Regular Path Queries

Boundedness of Conjunctive Regular Path Queries

... The translation is close to the language-preserving reduction from 2NFA to alternating 1NFA of [33], upgraded to take into account the cost of different alternation branches, somewhat in the same spirit as the history ...

33

Automatic Documents Analyzer and Classifier

Automatic Documents Analyzer and Classifier

... approach and techniques, we have restricted our experiment to a particular specific domain, the ...sources and build a baseline ontology about terrorism that organizes concepts of the domain in a hierarchy ...

19

Les documents numériques : numérisation et diffusion des documents

Les documents numériques : numérisation et diffusion des documents

... de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou ...

64

La gestion électronique des documents et la réédition de documents informatisés

La gestion électronique des documents et la réédition de documents informatisés

... Tanja Schleyer Sous la direction de M.. Resumd : Cette bibliographie a pour sujet 1'enseignement a distance en examinant ses domaines, methodes et moyens d'application. Des[r] ...

22

Boosting Constraint Acquisition via Generalization Queries

Boosting Constraint Acquisition via Generalization Queries

... standard queries and generalization queries asked by G -Q U A CQ with min VAR +cut- off=1 to learn the RLFAP model when fed with an increasingly more accurate knowledge of ...

7

Quality Awareness over Graph Pattern Queries

Quality Awareness over Graph Pattern Queries

... ALGORITHM AND COST The cost of a graph pattern query evaluation depends on the form of the ...pattern queries (conjunctive regular path queries including regular expres- sions with variables on ...

9

Conjunctive Queries on Probabilistic Graphs: Combined Complexity

Conjunctive Queries on Probabilistic Graphs: Combined Complexity

... PTIME #P-hard Numbers given correspond to proposi- tions for border cases, remaining cells can be filled using the inclusions from Figure 2. We last discuss the case when both the query and instance graphs are ...

17

SLA Definition for Multi-Cloud Queries

SLA Definition for Multi-Cloud Queries

... Unfortunately, providers do not offer out-of-the-box multi-cloud querying capabilities, leaving space for systems orchestrating query execution across multiple public databases in a DBaaS fashion. Since access to the ...

3

Show all 10000 documents...

Sujets connexes