Query database
Add entry by form
Add entry in bibtex format
Edit entries
Show variables

BibTex

Publications of the Mostrare project

Bibtex entries

International Journals

  1. [2008] Olivier Gauwin and Joachim Niehren and Yves Roos, Streaming Tree Automata, Information Processing Letters 1 109, 13-17
  2. [2008] Michel Latteux and Yves Roos and Alain Terlutte, Minimal NFA and biRFSA Languages, RAIRO
  3. [2007] Wim Martens and Joachim Niehren, On the Minimization of XML Schemas and Tree Automata for Unranked Trees, Journal of Computer and System Science 4 73, 550-583
  4. [2007] Katrin Erk and Joachim Niehren, Dominance Constraints in Stratified Context Unification, Information Processing Letters 4 101, 141-147
  5. [2007] Julien Carme and Rémi Gilleron and Aurélien Lemay and Joachim Niehren, Interactive Learning of Node Selecting Tree Transducers, Machine Learning 1 66, 33--67
  6. [2007] Denis Béchet and Annie Foret and Isabelle Tellier, Learnability of Pregroup Grammars, Studia Logica 87, 225--252
  7. [2007] Yves André and Anne-Cécile Caron and Denis Debarbieux and Yves Roos and Sophie Tison, Path Constraints in Semi-Structured Data, Theoretical Computer Science 1-3 385, 11-33
  8. [2006] Michel Latteux and Aurélien Lemay and Yves Roos and Alain Terlutte, Identification of biRFSA languages, Theoretical Computer Science 1-2 356, 212-223
  9. [2006] Joachim Niehren and Jan Schwinghammer and Gert Smolka, A Concurrent Lambda Calculus with Futures, Theoretical Computer Science 3 364, 338-356
  10. [2006] Céline Kuttler and Joachim Niehren, Gene Regulation in the Pi Calculus: Simulating Cooperativity at the Lambda Switch, Transactions on Computational Systems Biology VII 4220, 24-55
  11. [2005] Iovka Boneva and Jean-Marc Talbot, When Ambients Cannot be Opened, Theoretical Computer Science 333 2, 127-169
  12. [2005] François Denis and Rémi Gilleron and Fabien Letouzey, Learning from Positive and Unlabeled Examples, Theoretical Computer Science 1 348, 70-83
  13. [2003] Joachim Niehren and Tim Priesnitz, Non-Structural Subtype Entailment in Automata Theory, Information and Computation 2 169, 319-354
  14. [2003] Ernst Althaus and Denys Duchier and Alexander Koller and Kurt Mehlhorn and Joachim Niehren and Sven Thiel, An Efficient Graph Algorithm for Dominance Constraints, Algorithms 1 48, 194--219

International Conferences

  1. [2008] Jérôme Champavère and Rémi Gilleron and Aurélien Lemay and Joachim Niehren, Schema-Guided Induction of Monadic Queries, 9th International Colloquium on Grammatical Inference, Lecture Notes in Computer Science 5278, 15-28
  2. [2008] Jérôme Champavère and Rémi Gilleron and Aurélien Lemay and Joachim Niehren, Efficient Inclusion Checking for Deterministic Tree Automata and DTDs, 2nd International Conference on Language and Automata Theory and Applications, Lecture Notes in Computer Science 5196, 184--195
  3. [2008] Isabelle Tellier, How to Split Recursive Automata, 9th International Colloquium on Grammatical Inference, Lecture Notes in Computer Science 5278, 200-212
  4. [2008] Guillem Godoy and Sebastian Maneth and Sophie Tison, Classes of Tree Homomorphisms with Decidable Preservation of Regularity, Eleventh International Conference on Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science 4962, 127-141
  5. [2008] François Denis and Édouard Gilbert and Amaury Habrard and Faïssal Ouardi and Marc Tommasi, Relevant Representations for the Inference of Rational Stochastic Tree Languages, 9th International Colloquium on Grammatical Inference, Lecture Notes in Computer Science 5278
  6. [2008] Emmanuel Filiot and Sophie Tison, Regular n-ary Queries in Trees and Variable Independence, 5th IFIP International Conference on Theoretical Computer Science 273, 429-443
  7. [2008] Emmanuel Filiot and Jean-Marc Talbot and Sophie Tison, Tree Automata with Global Constraints, 12th International Conference on Developments in Language Theory (DLT), Lecture Notes in Computer Science 5257, 314-326
  8. [2007] Joachim Niehren and David Sabel and Manfred Schmidt-Schauß and Jan Schwinghammer, Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures, 23rd Conference on Mathematical Foundations of Programming Semantics, Electronical notes in theoretical computer science 173, 313-337
  9. [2007] Isabelle Tellier, Grammatical inference by specialization as a state splitting strategy, Proceedings of the Amsterdam Colloquium, 223-228
  10. [2007] Guillem Godoy and Sophie Tison, On the Normalization and Unique Normalization Properties of Term Rewrite Systems, International Conference on Automated Deduction, Lecture Notes in Computer Science 4603, 247-262
  11. [2007] Emmanuel Filiot and Joachim Niehren and Jean-Marc Talbot and Sophie Tison, Polynomial Time Fragments of XPath with Variables, 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 205-214
  12. [2007] Emmanuel Filiot and Jean-Marc Talbot and Sophie Tison, Satisfiability of a Spatial Logic with Tree Variables, 16th EACSL Annual Conference on Computer Science and Logic, Lecture Notes in Computer Science 4646, 130-145
  13. [2007] Céline Kuttler and Cédric Lhoussaine and Joachim Niehren, A Stochastic Pi Calculus for Concurrent Objects, Second International Conference on Algebraic Biology, Lecture Notes in Computer Science 4545, 232-246
  14. [2006] Rémi Gilleron and Patrick Marty and Marc Tommasi and Fabien Torre, Interactive Tuples Extraction from Semi-Structured Data, 2006 IEEE / WIC / ACM International Conference on Web Intelligence P2747, 997-1004
  15. [2006] Laurent Candillier and Isabelle Tellier and Fabien Torre and Olivier Bousquet, Cascade Evaluation of Clustering Algorithms, 17th European Conference on Machine Learning (ECML'2006), Lecture Notes in Computer Science LNAI 4212, 574--581
  16. [2006] Benjamin Habegger and Denis Debarbieux, Learning n-ary tree-pattern queries for web data integration, 5th International Conference on Ontologies, Databases, and Applications of Semantics, Lecture Notes in Computer Science 4275, 941-948
  17. [2006] Aurélien Lemay and Joachim Niehren and Rémi Gilleron, Learning n-ary Node Selecting Tree Transducers from Completely Annotated Examples, International Colloquium on Grammatical Inference, Lecture Notes in Artificial Intelligence 4201, 253-267
  18. [2005] Wim Martens and Joachim Niehren, Minimizing Tree Automata for Unranked Trees, 10th International Symposium on Database Programming Languages, Lecture Notes in Computer Science 3774, 232--246
  19. [2005] Laurent Candillier and Isabelle Tellier and Fabien Torre and Olivier Bousquet, SSC : Statistical Subspace Clustering, 4th International Conference on Machine Learning and Data Mining in Pattern Recognition (MLDM'2005), Lecture Notes in Computer Science LNAI 3587, 100--109
  20. [2005] Jordi Levy and Joachim Niehren and Mateu Villaret, Well-nested Context Unification, 20th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 3632, 149-163
  21. [2005] Joachim Niehren and Tim Priesnitz and Zhendong Su, Complexity of Subtype Satisfiability over Posets, 14th European Symposium on Programming, Lecture Notes in Computer Science 3444, 357-373
  22. [2005] Joachim Niehren and Mateu Villaret, Describing Lambda Terms in Context Unification, 5th International Conference on Logical Aspects in Computational Linguistics, Lecture Notes in Artificial Intelligence 3492, 221-237
  23. [2005] Joachim Niehren and Laurent Planque and Jean-Marc Talbot and Sophie Tison, N-ary Queries by Tree Automata, 10th International Symposium on Database Programming Languages, Lecture Notes in Computer Science 3774, 217--231
  24. [2005] Isabelle Tellier, When Categorial Grammars meet Regular Grammatical Inference, 5th International Conference on Logical Aspects of Computational Linguistics, Lecture Notes in Artificial Intelligence 4492, p.317-332
  25. [2005] Iovka Boneva and Jean-Marc Talbot, Automata and Logics for Unranked and Unordered Trees, 20th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 3467, 500--515
  26. [2005] Iovka Boneva and Jean-Marc Talbot and Sophie Tison, Expressiveness of a spatial logic for trees, 20th Annual IEEE Symposium on Logic in Computer Science, 280--289
  27. [2005] Hitoshi Ohsaki and Jean-Marc Talbot and Sophie Tison and Yves Roos, Monotone AC-Tree Automata, 12th International Conference on Logic for Programming Artificial Intelligence and Reasoning, Lecture Notes in Computer Science 3835, 337-351
  28. [2004] Yves André and Anne-Cécile Caron and Denis Debarbieux and Yves Roos and Sophie Tison, Extraction and Implication of Path Constraints, 29th Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 3153, 863-875
  29. [2004] Ruth Fuchss and Alexander Koller and Joachim Niehren and Stefan Thater, Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis, 42th Meeting of the Association for Computational Linguistics, 247-254
  30. [2004] Ralph Debusmann and Denys Duchier and Joachim Niehren, The XDG Grammar Development Kit, 2nd International Conference on Multiparadigm Programming in Mozart/Oz, Lecture Notes in Artificial Intelligence 3389, 190--201
  31. [2004] Manuel Bodirsky and Denys Duchier and Sebastian Miele and Joachim Niehren, A New Algorithm for Normal Dominance Constraints, ACM-SIAM Symposium on Discrete Algorithms, 54-78
  32. [2004] Julien Carme and Joachim Niehren and Marc Tommasi, Querying Unranked Trees with Stepwise Tree Automata, 19th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 3091, 105--118
  33. [2004] Julien Carme and Aurélien Lemay and Joachim Niehren, Learning Node Selecting Tree Transducer from Completely Annotated Examples, 7th International Colloquium on Grammatical Inference, Lecture Notes in Artificial Intelligence 3264, 91--102
  34. [2004] Iovka Boneva and Jean-Marc Talbot, On Complexity of Model-Checking for the TQL Logic, 3rd IFIP International Conference on Theoretical Computer Science
  35. [2004] D. Dudau-Sofronie and I. Tellier, A Study of Learnability of Lambek Grammars from Typed Examples, Proceedings of Categorial Grammars 04, 133-147
  36. [2004] D. Béchet and A. Foret and I. Tellier, Learnability of Pregroup Grammars, 7th International Colloquium on Grammatical Inference, Lecture Notes in Artificial Intelligence 3264, 65--76
  37. [2004] Benjamin Habegger and Mohamed Quafafou, Web Services for Information Extraction from the Web, IEEE International Conference on Web Services, 279--288
  38. [2004] Benjamin Habegger and Mohamed Quafafou, Context Generalization for Information Extraction from the Web, ACM/IEEE Web Intelligence Conference, 720--723
  39. [2004] Benjamin Habegger and Mohamed Quafafou, Building Web Information Extraction Tasks, ACM/IEEE Web Intelligence Conference, 349--355
  40. [2003] Katrin Erk and Joachim Niehren, Well-Nested Parallelism Constraints for Ellipsis Resolution, 11th Conference of the European Chapter of the Association of Computational Linguistics, 115--122
  41. [2003] Joachim Niehren and Stefan Thater, Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints, 41st Meeting of the Association of Computational Linguistics, 367-374
  42. [2003] J. Carme and R. Gilleron and A. Lemay and A. Terlutte and M. Tommasi, Residual Finite Tree Automata, 7th International Conference on Developments in Language Theory, Lecture Notes in Computer Science 2710, 171 -- 182
  43. [2003] Iovka Boneva and Jean-Marc Talbot, When Ambients Cannot be Opened, Proceedings of Sixth International Conference on Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science 2620, 169 -- 184
  44. [2003] Françesco de Comite and Rémi Gilleron and Marc Tommasi, Learning Multi-label Alternating Decision Trees from Texts and Data, International Conference on Machine Learning and Data Mining, Lecture Notes in Artificial Intelligence 2734, 35-49
  45. [2003] Denis Debarbieux and Yves Roos and Sophie Tison and Yves Andre and Anne-Cécile Caron, Path Rewriting in Semistructured Data, 4th International Conference on Combinatorics on Words 27, 358--369
  46. [2003] D. Dudau-Sofronie and I. Tellier and M. Tommasi, A Learnable Class of Classical Categorial Grammars from Typed Examples, 8th Conference on Formal Grammar, 77--88
  47. [2003] Alexander Koller and Joachim Niehren and Stefan Thater, Bridging the Gap Between Underspecification Formalisms: Hole Semantics as Dominance Constraints, Meeting of the European Chapter of the Association of Computational Linguistics, 195-202

International Workshops

  1. [2008] Slawek Staworko and Emmanuel Filiot and Jan Chomicki, Querying Regular Sets of XML Documents, International Workshop on Logic in Databases (LiD)
  2. [2008] Pierre Senellart and Avin Mittal and Daniel Muschick and Rémi Gilleron and Marc Tommasi, Automatic Wrapper Induction from Hidden-Web Sources with Domain Knowledge, Proceedings of ACM WIDM 2008 workshop on Web Information and Data Management
  3. [2008] Olivier Gauwin and Anne-Cécile Caron and Joachim Niehren and Sophie Tison, Complexity of Earliest Query Answering with Streaming Tree Automata, ACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X)
  4. [2007] Jérôme Champavère and Rémi Gilleron and Aurélien Lemay and Joachim Niehren, Towards Schema-Guided XML Query Induction, ICML-2007 Workshop on Challenges and Applications of Grammar Induction
  5. [2007] François Denis and Amaury Habrard and Edouard Gilbert and Rémi Gilleron and Marc Tommasi, On Probability Distributions for Trees: Representations, Inference and Learning, poster in NIPS Workshop on Representations and Inference on Probability Distributions
  6. [2006] Rémi Gilleron and Florent Jousse and Isabelle Tellier and Marc Tommasi, XML Document Transformation with Conditional Random Fields, INEX 2006, Lecture Notes in Computer Science 4518, 525-539
  7. [2006] Isabelle Tellier, Various types of learning with types, GI workshop, 15-16
  8. [2006] Florent Jousse and Rémi Gilleron and Isabelle Tellier and Marc Tommasi, Conditional Random Fields for XML Trees, ECML Workshop on Mining and Learning in Graphs
  9. [2006] Emmanuel Filiot and Joachim Niehren and Jean-Marc Talbot and Sophie Tison, Composing Monadic Queries in Trees, PLAN-X International Workshop, 61--70
  10. [2006] Céline Kuttler and Cédric Lhoussaine and Joachim Niehren, A Stochastic Pi Calculus for Concurrent Objects, 1st International Workshop on Probabilistic Automata and Logics
  11. [2005] Yves Andre and Anne-Cecile Caron and Denis Debarbieux and Yves Roos, Indexes and path constraints in semistructured data, DEXA Workshop on Logical Aspects and Applications of Integrity Constraints, 837 - 841
  12. [2005] Rémi Gilleron and Patrick Marty and Marc Tommasi and Fabien Torre, Statistical classification for wrapper induction, Dagstuhl Seminar: Machine Learning for the Semantic Web
  13. [2005] Laurent Candillier and Isabelle Tellier and Fabien Torre, Transforming XML trees for efficient classification and clustering, INEX 2005 Workshop on Mining XML documents
  14. [2005] Laurent Candillier and Isabelle Tellier and Fabien Torre and Olivier Bousquet, Cascade Evaluation of Clustering Algorithms, NIPS 2005 Workshop on Theoretical Foundations of Clustering
  15. [2005] Joachim Niehren and Jan Schwinghammer and Gert Smolka, A Concurrent Lambda Calculus with Futures, 5th International Workshop on Frontiers in Combining Systems, Lecture Notes in Artificial Intelligence 3717, 248-263
  16. [2005] I. Tellier, Automata and AB-Categorial Grammars, CIAA 05 (1Oth International Conference on Implementation and Application of Automata), 287-288
  17. [2003] F. Denis and R. Gilleron and A. Laurent and M. Tommasi, Text Classification and Co-training from Positive and Unlabeled Examples, Proceedings of the ICML Workshop: the Continuum from Labeled Data to Unlabeled Data in Machine Learning and Data Mining, 80 -- 87

French Journals

  1. [2007] Isabelle Tellier and Denis Béchet and Alexandre Dikovsky and Annie Foret and Yannick Le Nir and Erwan Moreau and Christian Rétoré, Modèles algorithmiques de l'acquisition de la syntaxe, Recherches Linguistiques de Vincennes
  2. [2006] Isabelle Tellier, Learning Recursive Automata from Positive Examples, Revue d'Intelligence Artificielle 20/2006 New Methods in Machine Learning, 775-804
  3. [2005] Fabien Torre, GloBoost : Combinaisons de Moindres Généralisés, Revue d'Intelligence Artificielle 4-5 19, 769-797

French Conferences

  1. [2006] Rémi Gilleron and Patrick Marty and Marc Tommasi and Fabien Torre, Extraction de relations dans les documents Web, Revue RNTI - Actes de EGC'06, 415--420
  2. [2006] Michel Latteux and Aurélien Lemay and Yves Roos and Alain Terlutte, Identification des langages biAFER, 8ème Conférence francophone sur l'Apprentissage automatique (CAp'2006) , 33--48
  3. [2006] Laurent Candillier and Isabelle Tellier and Fabien Torre and Olivier Bousquet, SuSE: Subspace Selection embedded in an EM algorithm, 8ème Conférence francophone sur l'Apprentissage automatique (CAp'2006), 331--345
  4. [2006] Laurent Candillier and Isabelle Tellier and Fabien Torre and Olivier Bousquet, Evaluation en Cascade d'Algorithmes de Clustering, 8ème Conférence francophone sur l'Apprentissage automatique (CAp'2006), 109--124
  5. [2006] Florent Jousse and Rémi Gilleron and Isabelle Tellier and Marc Tommasi, Champs conditionnels aléatoires pour l'annotation d'arbres, 8ème Conférence francophone sur l'Apprentissage automatique (CAp'2006), 171--186
  6. [2005] Laurent Candillier and Isabelle Tellier and Fabien Torre and Olivier Bousquet, SSC : Statistical Subspace Clustering, 5èmes Journées d'Extraction et Gestion des Connaissances (EGC'2005), 177--182
  7. [2005] Isabelle Tellier, Inférence grammaticale et grammaires catégorielles : vers la Grande Unification !, 7ème Conférence francophone sur l'apprentissage automatique, 63--78
  8. [2005] Florent Jousse and Isabelle Tellier and Marc Tommasi and Patrick Marty, Learning to Extract Answers in Question Answering: Experimental Studies, Actes de CORIA'05, p.85-100
  9. [2004] P. Marty and F. Torre, Codages et connaissances en extraction d'information, 6ième Conférence francophone sur l'apprentissage automatique, 207--222
  10. [2004] Laurent Candillier and Isabelle Tellier and Fabien Torre, Tuareg : classification non supervisée contextualisée, 6ème Conférence francophone sur l'Apprentissage automatique (CAp'2004), 159--174
  11. [2004] Fabien Torre, GloBoost : Boosting de moindres généralisés, 6ième Conférence francophone sur l'apprentissage automatique, 49--64
  12. [2004] Denis Debarbieux, Données semi-structurées et contraintes de chemin, MAJECSTIC'04
  13. [2004] Denis Debarbieux and Yves Roos and Sophie Tison, Models of Path Constraints, 10ièmes Journées Montoises d'Informatique Théorique
  14. [2004] D. Dudau-Sofronie and I. Tellier, Un modèle d'acquisition de la syntaxe à l'aide d'informations sémantiques, actes de la 11ème Conférence TALN, Traitement Automatique du Langage Naturel, 137--146
  15. [2003] J. Carme and A. Lemay and A. Terlutte, Identification à la limite de langages réguliers d'arbres à résiduels premiers disjoints, 5ème Conférence francophone sur l'apprentissage automatique, 217 -- 232
  16. [2003] D. Dudau-Sofronie and I. Tellier and M. Tommasi, Une classe de grammaires catégorielles apprenable à partir d'exemples typés, 5ème Conférence francophone sur l'apprentissage automatique, 169--184
  17. [2003] Anne-Cécile Caron and Denis Debarbieux and Yves Roos, Modéles de données semi-structurées et contraintes d'inclusion, Extraction et Gestion des Connaissances 17, 461-472

French Workshops

  1. [2005] Laurent Candillier and Isabelle Tellier and Fabien Torre and Olivier Bousquet, SuSE: Subspace Selection embedded in an EM algorithm, 2èmes Rencontres Inter-Associations sur la classification et ses applications (RIAs'2006)
  2. [2005] Laurent Candillier and Isabelle Tellier and Fabien Torre and Olivier Bousquet, Evaluation en Cascade d'Algorithmes de Clustering, 2èmes Rencontres Inter-Associations sur la classification et ses applications (RIAs'2006)

Phd and Habilitation thesis

  1. [2008] Emmanuel Filiot, Logics for n-ary queries in trees, Université des Sciences et Technology de Lille (Lille 1)
  2. [2007] Patrick Marty, Induction d'extraction n-aire pour les documents semi-structurés, Université Charles de Gaulle, Lille 3
  3. [2007] Florent Jousse, Transformations d'Arbres XML avec des Modèles Probabilistes pour l'Annotation, Université Charles de Gaulle - Lille 3
  4. [2006] Marc Tommasi, Habilitation. Structures arborescentes et apprentissage automatique
  5. [2006] Laurent Candillier, Contextualisation, Visualisation et Evaluation en Apprentissage Non Supervisé, GRAppA, Université Charles de Gaulle, Lille 3
  6. [2006] Iovka Boneva, Logics for unranked and unordered trees and their use for querying semistructured data
  7. [2006] Denis Debarbieux, Requêtes Graphes, Journées sur les documents multistructurés
  8. [2005] Julien Carme, Inférence de requêtes dans les arbres et applications à l'extraction d'informations sur le Web, Université Charles-de-Gaulle - Lille 3
  9. [2005] Jean-Marc Talbot, Habilitation. Model-checking pour les ambients : des algèbres de processus aux données semi-structurées
  10. [2005] Isabelle Tellier, Habilitation. Modéliser l'acquisition de la syntaxe via l'hypothèse de la primauté du sens, Université Charles de Gaule, Lille 3
  11. [2005] Denis Debarbieux, Modélisation et requêtes des documents semi-structurés: exploitation de la structure de graphe, Université des Sciences et Technologies de Lille, Lille I

Others

  1. [2010] Jérome Champavère and Rémi Gilleron and Aurélien Lemay and Joachim Niehren, Schema-Guided Query Induction, Journal of Machine Learning Research
  2. [2006] Zhendong Su and Alexander Aiken and Joachim Niehren and Tim Priesnitz and Ralf Treinen, First-Order Theory of Subtyping Constraints, ACM Transactions on Programming Languages and Systems

Submitted Papers or Technical Reports

  1. [2006] Michel Latteux and Yves Roos and Alain Terlutte, BiRFSA languages and minimal NFAs GRAPPA-0205
  2. [2005] Laurent Candillier and Isabelle Tellier and Fabien Torre and Olivier Bousquet, SSC : Statistical Subspace Clustering GRAppA Report 0105
  3. [2005] Emmanuel Filiot, Composition de requêtes monadiques, Université des Sciences et Technologies de Lille
  4. [2005] Benjamin Habegger, Tree-pattern generalization for information extraction from the Web





Valid HTML 4.01! Valid CSS!