Team mostrare

Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Contracts and Grants with Industry
Other Grants and Activities
Dissemination
Bibliography

Bibliography

Major publications by the team in recent years

[1]
I. Boneva, J.-M. Talbot, S. Tison.
Expressiveness of a spatial logic for trees, in: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS'05), IEEE Comp. Soc. Press, 2005, p. 280 - 289.
[2]
L. Candillier, I. Tellier, F. Torre, O. Bousquet.
Cascade Evaluation of Clustering Algorithms, in: 17th European Conference on Machine Learning (ECML'2006), Lecture Notes in Artificial Intelligence, Springer Verlag, 2006, vol. 4212, p. 574–581.
[3]
J. Carme, R. Gilleron, A. Lemay, J. Niehren.
Interactive Learning of Node Selecting Tree Transducers, in: Machine Learning, 2007, vol. 66, no 1, p. 33–67
http://hal.inria.fr/inria-00087226.
[4]
J. Champavère, R. Gilleron, A. Lemay, J. Niehren.
Efficient Inclusion Checking for Deterministic Tree Automata and XML Schemas, in: Information and Computation, 2009, vol. 207, no 11, p. 1181-1208
http://hal.inria.fr/inria-00366082/en/.
[5]
E. Filiot, J. Niehren, J.-M. Talbot, S. Tison.
Polynomial Time Fragments of XPath with Variables, in: 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, ACM-Press, 2007, p. 205-214
http://hal.inria.fr/inria-00135678.
[6]
E. Filiot, J.-M. Talbot, S. Tison.
Satisfiability of a Spatial Logic with Tree Variables, in: 16th EACSL Annual Conference on Computer Science and Logic, Lecture Notes in Computer Science, Springer Verlag, 2007, vol. 4646, p. 130-145
http://hal.inria.fr/inria-00148462.
[7]
O. Gauwin, J. Niehren, S. Tison.
Bounded Delay and Concurrency for Earliest Query Answering, in: 3rd International Conference on Language and Automata Theory and Applications, Espagne Tarragona, A. H. Dediu, A. M. Ionescu, C. Martin-Vide (editors), Springer, 2009, vol. 5457, p. 350-361
http://hal.inria.fr/inria-00348463/fr.
[8]
R. Gilleron, F. Jousse, M. Tommasi, I. Tellier.
Conditional Random Fields for XML Applications, INRIA, 2008
http://hal.inria.fr/inria-00342279/en/, RR-6738.
[9]
R. Gilleron, P. Marty, M. Tommasi, F. Torre.
Interactive Tuples Extraction from Semi-Structured Data, in: 2006 IEEE / WIC / ACM International Conference on Web Intelligence, IEEE Comp. Soc. Press, 2006, vol. P2747, p. 997-1004.
[10]
W. Martens, J. Niehren.
On the Minimization of XML Schemas and Tree Automata for Unranked Trees, in: Journal of Computer and System Science, 2007, vol. 73, no 4, p. 550-583
http://hal.inria.fr/inria-00088406.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[11]
O. Gauwin.
Flux XML, Requêtes XPath et Automates, Université des Sciences et Technologie de Lille - Lille I, 09 2009
http://tel.archives-ouvertes.fr/tel-00421911/en/, Ph. D. Thesis.

Articles in International Peer-Reviewed Journal

[12]
J. Champavère, R. Gilleron, A. Lemay, J. Niehren.
Efficient Inclusion Checking for Deterministic Tree Automata and XML Schemas, in: Information and Computation, 2009, vol. 207, no 11, p. 1181-1208
http://hal.inria.fr/inria-00366082/en/.
[13]
M. John, C. Lhoussaine, J. Niehren, A. Uhrmacher.
The Attributed Pi Calculus with Priorities, in: Transactions on Computational Systems Biology, 2009
http://hal.inria.fr/inria-00422969/en/.
[14]
M. Latteux, Y. Roos, A. Terlutte.
Minimal NFA and biRFSA Languages, in: RAIRO - Theoretical Informatics and Applications, 2009, vol. 43, no 2, p. 221-237
http://hal.inria.fr/inria-00296658/en/.

International Peer-Reviewed Conference/Proceedings

[15]
O. Gauwin, J. Niehren, S. Tison.
Bounded Delay and Concurrency for Earliest Query Answering, in: 3rd International Conference on Language and Automata Theory and Applications, Espagne Tarragona, A. H. Dediu, A. M. Ionescu, C. Martin-Vide (editors), Springer, 2009, vol. 5457, p. 350-361
http://hal.inria.fr/inria-00348463/en/.
[16]
O. Gauwin, J. Niehren, S. Tison.
Earliest Query Answering for Deterministic Nested Word Automata, in: 17th International Symposium on Fundamentals of Computer Theory, Pologne Wraclaw, SV, 2009, vol. 5699, p. 121-132
http://hal.inria.fr/inria-00390236/en/.
[17]
B. Groz, S. Staworko, A.-C. Caron, Y. Roos, S. Tison.
XML Security Views Revisited, in: International Symposium on Database Programming Languages, France LYON, F. G. Philippa Gardner (editor), Springer, 2009, vol. LNCS, p. pp 52-67
http://hal.archives-ouvertes.fr/hal-00396796/en/.
[18]
M. John, C. Lhoussaine, J. Niehren.
Dynamic Compartments in the Imperative Pi Calculus, in: Dynamic Compartments in the Imperative Pi Calculus, Italie Bologna, Spinger, 2009, vol. 5688, p. 235-250
http://hal.inria.fr/inria-00422970/en/.
[19]
K. Lingbo, R. Gilleron, A. Lemay.
Retrieving Meaningful Relaxed Tightest Fragments for XML Keyword Search, in: EDBT 2009, Russie Saint Petersburg, 2009
http://hal.inria.fr/inria-00433097/en/.
[20]
E. Moreau, I. Tellier, A. Balvet, G. Laurence, A. Rozenknop, T. Poibeau.
Annotation fonctionnelle de corpus arboré avec des Champs Aléatoires Conditionnels, in: TALN 2009, France Senlis, 2009, . p
http://hal.archives-ouvertes.fr/hal-00436330/en/.
[21]
J. Schwinghammer, D. Sabel, M. Schmidt-Schauss, J. Niehren.
Correctly Translating Concurrency Primitives, in: The 2009 SIGPLAN Workshop on ML, Royaume-Uni Edinburgh, A. Rossberg (editor), 2009, p. 27-38
http://hal.inria.fr/inria-00429239/en/.
[22]
S. Staworko, G. Laurence, A. Lemay, J. Niehren.
Equivalence of Deterministic Word to Word Transducers, in: Fundamuntals of Computation Theory, Pologne Wroclaw, M. Gebala, M. Korzeniowska, W. Charatonik (editors), Springer, Maciej Gebala and Malgorzata Korzeniowska, 2009, vol. 5699, p. 310-322
http://hal.inria.fr/inria-00423961/en/.

National Peer-Reviewed Conference/Proceedings

[23]
A. Terlutte, F. Torre.
Identification des langages rationnels à résiduels k-disjoints, in: 11e Conférence francophone sur l'Apprentissage automatique (CAp'2009), Tunisie Hammamet, Y. Bennani, C. Rouveirol (editors), 2009, p. 21-32
http://hal.inria.fr/inria-00425073/en/.
[24]
F. Torre, A. Terlutte.
Méthodes d'ensemble en inférence grammaticale : une approche à base de moindres généralisés, in: 11e Conférence francophone sur l'Apprentissage automatique (CAp'2009), Tunisie Hammamet, Y. Bennani, C. Rouveirol (editors), 2009, p. 33-48
http://hal.inria.fr/inria-00425072/en/.

References in notes

[25]
V. Benzaken, G. Castagna, A. Frisch.
CDuce: an XML-centric general-purpose language, in: ACM SIGPLAN Notices, 2003, vol. 38, no 9, p. 51–63.
[26]
V. Benzaken, G. Castagna, C. Miachon.
A Full Pattern-Based Paradigm for XML Query Processing., in: PADL, Lecture Notes in Computer Science, Springer Verlag, 2005, p. 235-252.
[27]
J. Berstel, C. Reutenauer.
Recognizable formal power series on trees, in: Theorical computer science, 1982, vol. 18, p. 115–148.
[28]
G. Castagna.
Patterns and Types for Querying XML, in: 10th International Symposium on Database Programming Languages, Lecture Notes in Computer Science, Springer Verlag, 2005, vol. 3774, p. 1 - 26.
[29]
B. Chidlovskii.
Wrapping Web Information Providers by Transducer Induction, in: Proc. European Conference on Machine Learning, Lecture Notes in Artificial Intelligence, 2001, vol. 2167, p. 61 – 73.
[30]
B. Chidlovskii, J. Fuselier.
A probabilistic learning method for XML annotation of documents, in: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI'05), 2005, p. 1016-1021.
[31]
F. Denis, A. Habrard.
Learning rational stochastic tree languages, in: Algorithmic learning theory, M. Hutter, R. A. Servedio, E. Takimoto (editors), Lecture Notes in Artificial Intelligence, Springer-Verlag, 18th International Conference, ALT 2007, Octobre 2007, vol. 4754, p. 242–256.
[32]
A. Doan, A. Y. Halevy.
Semantic Integration Research in the Database Community: A Brief Survey, in: AI magazine, 2005, vol. 26, no 1, p. 83-94.
[33]
J. Eisner.
Parameter Estimation for Probabilistic Finite-State Transducers, in: Proceedings of the Annual meeting of the association for computational linguistic, 2002, p. 1–8.
[34]
J. Engelfriet.
Bottom-up and top-down tree transformations. A comparision, in: Mathematical System Theory, 1975, vol. 9, p. 198–231.
[35]
J. Engelfriet, S. Maneth.
Macro tree transducers, attribute grammars, and MSO definable tree translations, in: Information and Computation, 1999, vol. 154, no 1, p. 34–91.
[36]
V. Gapeyev, B. Pierce.
Regular Object Types, in: European Conference on Object-Oriented Programming, 2003
http://www.cis.upenn.edu/~bcpierce/papers/regobj.pdf.
[37]
J. Graehl, K. Knight.
Training tree transducers, in: NAACL-HLT, 2004, p. 105-112.
[38]
H. Hosoya, B. Pierce.
Regular expression pattern matching for XML, in: Journal of Functional Programming, 2003, vol. 6, no 13, p. 961-1004.
[39]
K. Knight, J. Graehl.
An overview of probabilistic tree transducers for natural language processing, in: Sixth International Conference on Intelligent Text Processing, 2005, p. 1-24.
[40]
C. Koch.
On the complexity of nonrecursive XQuery and functional query languages on complex values, in: 24th SIGMOD-SIGACT-SIGART Symposium on Principles of Database systems, ACM-Press, 2005, p. 84–97.
[41]
M. Y. Levin, B. Pierce.
Type-based Optimization for Regular Patterns, in: 10th International Symposium on Database Programming Languages, Lecture Notes in Computer Science, 2005, vol. 3774.
[42]
S. Maneth, A. Berlea, T. Perst, H. Seidl.
XML type checking with macro tree transducers, in: 24th ACM Symposium on Principles of Database Systems, 2005, p. 283–294.
[43]
C. Manning, H. Schütze.
Foundations of Statistical Natural Language Processing, MIT Press, Cambridge, 1999.
[44]
W. Martens, F. Neven.
Typechecking Top-Down Uniform Unranked Tree Transducers, in: 9th International Conference on Database Theory, London, UK, Lecture Notes in Computer Science, Springer Verlag, 2003, vol. 2572, p. 64–78.
[45]
J. Oncina, P. Garcia, E. Vidal.
Learning Subsequential Transducers for Pattern Recognition and Interpretation Tasks, in: IEEE Trans. Patt. Anal. and Mach. Intell., 1993, vol. 15, p. 448-458.
[46]
C. Sutton, A. McCallum.
An Introduction to Conditional Random Fields for Relational Learning, in: Introduction to Statistical Relational Learning, MIT Press, 2006.
[47]
B. Taskar, V. Chatalbashev, D. Koller, C. Guestrin.
Learning Structured Prediction Models: A Large Margin Approach, in: Proceedings of the Twenty Second International Conference on Machine Learning (ICML'05), 2005, p. 896 – 903.
[48]
I. Tsochantaridis, T. Joachims, T. Hofmann, Y. Altun.
Large Margin Methods for Structured and Interdependent Output Variables, in: Journal of Machine Learning Research, 2005, vol. 6, p. 1453–1484.
[49]
S. Vansummeren.
Deciding Well-Definedness of XQuery Fragments, in: Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2005, p. 37–48.

previous
next