Filter your results
- 1627
- 847
- 5
- 1422
- 658
- 100
- 87
- 55
- 53
- 30
- 28
- 28
- 10
- 5
- 1
- 1
- 1
- 2059
- 301
- 165
- 115
- 98
- 58
- 53
- 30
- 19
- 3
- 3
- 2
- 2
- 34
- 27
- 25
- 24
- 2
- 120
- 141
- 168
- 252
- 214
- 215
- 181
- 212
- 204
- 187
- 138
- 127
- 84
- 63
- 46
- 30
- 22
- 13
- 8
- 9
- 9
- 4
- 3
- 1
- 6
- 5
- 5
- 3
- 1
- 1
- 3
- 1
- 1
- 2274
- 205
- 2115
- 233
- 90
- 78
- 57
- 51
- 50
- 45
- 43
- 38
- 30
- 28
- 26
- 25
- 24
- 21
- 21
- 20
- 20
- 19
- 18
- 16
- 16
- 15
- 14
- 14
- 14
- 13
- 13
- 13
- 12
- 11
- 11
- 11
- 11
- 11
- 10
- 10
- 10
- 10
- 10
- 10
- 9
- 9
- 9
- 9
- 9
- 8
- 8
- 8
- 8
- 8
- 8
- 7
- 7
- 7
- 7
- 7
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 166
- 114
- 86
- 85
- 80
- 75
- 72
- 71
- 70
- 70
- 70
- 68
- 66
- 65
- 65
- 63
- 62
- 54
- 49
- 49
- 49
- 48
- 47
- 44
- 44
- 43
- 43
- 42
- 40
- 38
- 38
- 37
- 36
- 35
- 35
- 34
- 33
- 33
- 30
- 29
- 28
- 27
- 27
- 27
- 27
- 24
- 24
- 23
- 23
- 23
- 23
- 21
- 21
- 21
- 20
- 20
- 20
- 19
- 19
- 19
- 18
- 18
- 18
- 18
- 17
- 17
- 17
- 17
- 16
- 16
- 16
- 16
- 16
- 14
- 14
- 13
- 13
- 13
- 13
- 13
- 13
- 12
- 12
- 12
- 12
- 12
- 12
- 12
- 12
- 12
- 12
- 12
- 12
- 12
- 12
- 12
- 11
- 11
- 11
- 11
2 479 Results
|
Wireless Node Cooperation with Resource Availability ConstraintsWIOPT'17 - Workshop on Spatial Stochastic Models
for Wireless Networks (SpaSWiN), May 2017, Paris, France. ⟨10.23919/WIOPT.2017.7959946⟩
Conference papers
hal-01481627v1
|
||
|
Conjunctive Queries on Probabilistic Graphs: Combined ComplexityPrinciples of Database Systems (PODS), May 2017, Chicago, United States. ⟨10.1145/3034786.3056121⟩
Conference papers
hal-01486634v1
|
||
|
When Can We Answer Queries Using Result-Bounded Data Interfaces?Logical Methods in Computer Science, 2022
Journal articles
hal-03712199v1
|
||
|
Top-k Querying of Unknown Values under Order Constraints (Extended Version)2017
Preprints, Working Papers, ...
hal-01439310v1
|
||
|
Uniform Reliability of Self-Join-Free Conjunctive QueriesLogical Methods in Computer Science, In press
Journal articles
hal-03807851v1
|
||
|
Weighted Counting of Matchings in Unbounded-Treewidth Graph FamiliesMFCS, Aug 2022, Vienna, Austria
Conference papers
hal-03712197v1
|
||
|
Topological Sorting with Regular ConstraintsICALP 2018 - 45th International Colloquium on Automata, Languages, and Programming, Jul 2018, Prague, Czech Republic. pp.115:1--115:14
Conference papers
hal-01950909v1
|
||
|
Combined Tractability of Query Evaluation via Tree Automata and CycluitsICDT 2017 - International Conference on Database Theory, Mar 2017, Venice, Italy. ⟨10.4230/LIPIcs.ICDT.2017.6⟩
Conference papers
hal-01439294v1
|
||
|
Constant-Delay Enumeration for Nondeterministic Document SpannersSIGMOD record, 2020, 49 (1), pp.25-32. ⟨10.1145/3422648.3422655⟩
Journal articles
hal-03046848v1
|
||
Tractable Lineages on Treelike Instances: Limits and ExtensionsPODS (Principles of Database Systems), Jun 2016, San Francisco, United States. pp.355-370
Conference papers
hal-01336514v1
|
|||
Finite Open-World Query Answering with Number RestrictionsLICS 2015, Jul 2015, Kyoto, Japan. pp.305-316
Conference papers
hal-01190580v1
|
|||
Combining Existential Rules and Description LogicsIJCAI 2015, Jul 2015, Buenos Aires, Argentina. pp.2691-2697
Conference papers
hal-01190601v1
|
|||
Uncertainty in Crowd Data Sourcing under Structural ConstraintsUnCrowd, Apr 2014, Bali, Indonesia. pp.351-359
Conference papers
hal-01190716v1
|
|||
|
Computing Possible and Certain Answers over Order-Incomplete DataTheoretical Computer Science, 2019, 797, pp.42-76. ⟨10.1016/j.tcs.2019.05.013⟩
Journal articles
hal-01891814v1
|
||
Circuits de provenance pour les arbres et les instances quasi-arborescentesBDA, Sep 2015, Porquerolles, France
Conference papers
hal-02287157v1
|
|||
|
When Can We Answer Queries Using Result-Bounded Data Interfaces?PODS 2018, Jun 2018, Houston, United States
Conference papers
hal-02079064v1
|
||
The Possibility Problem for Probabilistic XMLAlberto Mendelzon International Workshop on Foundations of Data Management, Jun 2014, Carthagène des Indes, Colombia
Conference papers
hal-01190712v1
|
|||
|
Enumerating Regular Languages with Bounded Delay2022
Preprints, Working Papers, ...
hal-03940590v1
|
||
Top-k Queries on Unknown Values under Order ConstraintsICDT 2017, Mar 2017, Venice, Italy
Conference papers
hal-02287482v1
|
|||
|
Worst-case Analysis for Interactive Evaluation of Boolean ProvenanceTaPP workshop, Jun 2022, Philadelphia, United States
Conference papers
hal-03712198v1
|
||
|
Connecting Knowledge Compilation Classes and Width ParametersTheory of Computing Systems, 2020, ⟨10.1007/s00224-019-09930-2⟩
Journal articles
hal-02163749v1
|
||
|
Query Answering with Transitive and Linear-Ordered DataTwenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, Jul 2016, New York, United States
Conference papers
hal-01413881v1
|
||
Structurally Tractable Uncertain DataSIGMOD/PODS Ph.D. Symposium, Jun 2015, Melbourne, Australia. pp.39-44
Conference papers
hal-01190610v1
|
|||
|
Leveraging the structure of uncertain dataDatabases [cs.DB]. Télécom ParisTech, 2016. English. ⟨NNT : 2016ENST0021⟩
Theses
tel-01345836v2
|
||
|
Finite Open-world Query Answering with Number RestrictionsACM Transactions on Computational Logic, 2020, 21 (4), pp.1-73. ⟨10.1145/3365834⟩
Journal articles
hal-02941917v1
|
||
|
Efficient enumeration algorithms for annotated grammarsPODS 2022, Jun 2022, Philadelphie, United States
Conference papers
hal-03654592v1
|
||
Requêtes sur des données à ordre incompletBDA, Sep 2015, Porquerolles, France
Conference papers
hal-02288441v1
|
|||
Provenance Circuits for Trees and Treelike InstancesICALP 2015, Jun 2015, Kyoto, Japan. pp.56-68
Conference papers
hal-01178399v1
|
|||
|
Query Answering with Transitive and Linear-Ordered DataJournal of Artificial Intelligence Research, 2018, 63, pp.191-264. ⟨10.1613/jair.1.11240⟩
Journal articles
hal-02338348v1
|
||
Possibility for Probabilistic XMLIngénierie des Systèmes d'Information, 2015, 20 (5), pp.53-75
Journal articles
hal-01336826v1
|