Filtrer vos résultats
- 28
- 23
- 31
- 11
- 4
- 4
- 1
- 4
- 51
- 2
- 2
- 1
- 2
- 1
- 3
- 1
- 3
- 3
- 1
- 4
- 2
- 4
- 2
- 5
- 1
- 2
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 2
- 2
- 1
- 2
- 1
- 1
- 47
- 4
- 40
- 31
- 24
- 7
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 51
- 22
- 9
- 7
- 6
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 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
- 1
- 1
- 1
- 1
- 1
51 résultats
|
|
triés par
|
|
Efficient Inclusion Checking for Deterministic Tree Automata and XML SchemasInformation and Computation, 2009, 207 (11), pp.1181-1208. ⟨10.1016/j.ic.2009.03.003⟩
Article dans une revue
inria-00366082v3
|
||
Text Classification from Positive and Unlabeled ExamplesProceedings of the 9th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU'02, 2002, Grenoble, France. pp.1927--1934
Communication dans un congrès
inria-00538889v1
|
|||
|
Exploring Category Structure with Contextual Language Models and Lexical Semantic NetworksEACL 2023 - 17th Conference of the European Chapter of the Association for Computational Linguistics, May 2023, Dubrovnik, Croatia
Communication dans un congrès
hal-03986142v1
|
||
Learning From Positive and Unlabeled examplesProceedings of the 11th International Conference on Algorithmic Learning Theory, ALT'00, 2000, Sydney, Australia. pp.71--85
Communication dans un congrès
inria-00538887v1
|
|||
|
Hypernode Graphs for Spectral Learning on Binary Relations over SetsECML/PKDD - 7th European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Sep 2014, Nancy, France
Communication dans un congrès
hal-01017025v1
|
||
|
Conditional Random Fields for XML TreesWorkshop on Mining and Learning in Graphs, Sep 2006, Berlin, Germany
Communication dans un congrès
inria-00118761v1
|
||
|
Query Induction with Schema-Guided Pruning StrategiesJournal of Machine Learning Research, 2013, 14 (1), pp.927−964
Article dans une revue
inria-00607121v2
|
||
|
Schema-Guided Induction of Monadic Queries9th International Colloquium on Grammatical Inference, Sep 2008, Saint-Malo, France. pp.15-28, ⟨10.1007/978-3-540-88009-7_2⟩
Communication dans un congrès
inria-00309408v2
|
||
The Reachability Problem for Ground TRS and Some ExtensionsProceedings of the International Joint Conference on Theory and Practice of Software Development, TAPSOFT, Vol.1, 1989, Barcelona, Spain. pp.227-243
Communication dans un congrès
inria-00538873v1
|
|||
Bottom-Up Tree Pushdown Automata and Rewrite SystemsProceedings of the 4th International Conference on Rewriting Techniques and Applications, RTA'91, 1991, Como, Italy. pp.287-298
Communication dans un congrès
inria-00538876v1
|
|||
For a rewrite system it is decidable whether the set of irreducible ground terms is recognizable.Bulletin- European Association for Theoretical Computer Science, 1992, 48, pp.197--209
Article dans une revue
inria-00538877v1
|
|||
|
Learning from Positive and Unlabeled ExamplesTheoretical Computer Science, 2005, 348 (1), pp.70-83. ⟨10.1016/j.tcs.2005.09.007⟩
Article dans une revue
inria-00536692v1
|
||
Décidabilité et ComplexitéIA Handbook, Cépaduès, pp.1-63, 2010
Chapitre d'ouvrage
hal-00999661v1
|
|||
|
Retrieving Meaningful Relaxed Tightest Fragments for XML Keyword SearchEDBT 2009, 2009, Saint Petersburg, Russia
Communication dans un congrès
inria-00433097v1
|
||
|
Hypernode Graphs for Spectral Learning on Binary Relations over SetsConférence Francophone sur l'Apprentissage Automatique (Cap 2014), Jul 2014, Saint-Etienne, France. ⟨10.1007/978-3-662-44851-9_42⟩
Communication dans un congrès
hal-01104618v1
|
||
Proofs and reachability problem for ground rewrite systemsAspects and Prospects of Theoretical Computer Science, 6th International Meeting of Young Computer Scientists, IMYCS'90, 1990, Prag, Czech Republic. pp.120-129
Communication dans un congrès
inria-00538874v1
|
|||
Decision Problems for Term Rewrite Systems and Recognizable Tree LanguagesProceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science, STACS 91, 1991, Munich, Germany. pp.148--159
Communication dans un congrès
inria-00538875v1
|
|||
Some new Decidability Results on Positive and Negative Set ConstraintsProceedings of First International Conference on Constraints in Computational Logics, CCL'94, 1994, Munich, Germany. pp.336--351
Communication dans un congrès
inria-00538880v1
|
|||
Positive and Unlabeled Examples Help LearningProceedings of the Tenth International Conference on Algorithmic Learning Theory, ALT'99, 1999, Tokyo, Japan. pp.219--230
Communication dans un congrès
inria-00538885v1
|
|||
Automatic Wrapper Induction from Hidden-Web Sources with Domain KnowledgeInternational Workshop on Web information and data managment, Oct 2008, Napa, United States. pp.9-16
Communication dans un congrès
inria-00337098v1
|
|||
Solving Systems of Set Constraints using Tree AutomataProceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, STACS'93, 1993, Würzburg, Germany. pp.505--514
Communication dans un congrès
inria-00538878v1
|
|||
Solving Systems of Set Constraints with Negated Subset RelationshipsProceedings of the $34^th$ Symposium on Foundations of Computer Science, FOCS'93, 1993, Palo Alto California, United States. pp.372--380
Communication dans un congrès
inria-00538879v1
|
|||
Bottom-up Tree Pushdown Automata: Classification and Connection with Rewrite SystemsTheoretical Computer Science, 1994, 127 (1), pp.69--98
Article dans une revue
inria-00538881v1
|
|||
PAC Learning with Simple Examples13th Annual Symposium on Theoretical Aspects of Computer Science, STACS'96, 1996, Munich, France. pp.231--242
Communication dans un congrès
inria-00538883v1
|
|||
|
Learning n-ary Node Selecting Tree Transducers from Completely Annotated Examples8th International Colloquium on Grammatical Inference, Sep 2006, Tokyo, Japan. pp.253-267
Communication dans un congrès
inria-00088077v2
|
||
|
On Probability Distributions for Trees: Representations, Inference and LearningNIPS Workshop on Representations and Inference on Probability Distributions, Dec 2007, Whistler, Canada
Communication dans un congrès
inria-00294636v1
|
||
|
Skill Rating for Multiplayer Games Introducing Hypernode Graphs and their Spectral TheoryJournal of Machine Learning Research, 2020, 21, pp.1 - 18
Article dans une revue
hal-02566930v1
|
||
|
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs2nd International Conference on Language and Automata Theory and Applications, Mar 2008, Tarragona, Spain. pp.184-195
Communication dans un congrès
inria-00192329v6
|
||
Learning Multiple Tasks with Boosted Decision TreesECML/PKDD - European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases - 2012, 2012, Bristol, United Kingdom
Communication dans un congrès
hal-00727749v1
|
|||
|
WordNet Is All You Need: A Surprisingly Effective Unsupervised Method for Graded Lexical EntailmentFindings of the Association for Computational Linguistics: EMNLP 2023, 2023, Singapore, France
Communication dans un congrès
hal-04250849v1
|
- 1
- 2