Lifo - Laboratoire d'Informatique Fondamentale d'orléans INSA Centre Val de Loire Université d'Orléans Université d'Orléans

Lifo > Publications de l'année 2008

 English Version



Contact

LIFO - Bâtiment IIIA
Rue Léonard de Vinci
B.P. 6759
F-45067 ORLEANS Cedex 2

Email: contact.lifo
Tel: +33 (0)2 38 41 99 29
Fax: +33 (0)2 38 41 71 37



Accès aux publications de l'année : 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024


Revue internationale à comité de lecture


[hal-00466766:1]
Marco Benedetti & Hratch Mangassarian, Experience and Perspectives in QBF-Based Formal Verification, Journal on Satisfiability, Boolean Modeling and Computation (JSAT), Vol. 5. Pp. 133-191. 2008. [URL]
[inria-00328487:1]
Yohan Boichut & Pierre-Cyrille Heam, A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations, Information Processing Letters, Vol. 108(1). Pp. 1-2, Elsevier. 2008. [URL]
[inria-00429345:1]
Yohan Boichut, Pierre-Cyrille Heam & Olga Kouchnarenko, Approximation based tree regular model checking, Nordic Journal of Computing, Vol. 14. Pp. 216-241, Publishing Association Nordic Journal of Computing. 2008. [URL]
[hal-00202312:1]
Khalil Djelloul, Thi-Bich-Hanh Dao & Thom Fruehwirth, Theory of Finite or Infinite Trees Revisited, Theory and Practice of Logic Programming, Vol. 8(4). Pp. 8(4):1-60, Cambridge University Press (CUP). 2008. [URL]
[hal-02904714:1]
Julie Dubois, Stéphane Bourg, Christel Vrain & Luc Morin-Allory, Collections of Compounds -- How to Deal with them?, Current Computer Aided-Drug Design, Vol. 4(3). Pp. 156-168, Bentham Science Publishers. 09. 2008. [URL]
[hal-00462391:1]
Fedor V. Fomin, Dieter Kratsch, Ioan Todinca & Yngve Villanger, Exact Algorithms for Treewidth and Minimum Fill-In, SIAM Journal on Computing, Vol. 38(3). Pp. 1058-1079, Society for Industrial and Applied Mathematics. 2008. [URL]
[hal-00462387:1]
Dieter Kratsch, Haiko Müller & Ioan Todinca, Feedback vertex set on AT-free graphs, Discrete Applied Mathematics, Vol. 156(10). Pp. 1936-1947, Elsevier. 2008. [URL]
[hal-00462388:1]
Ivan Rapaport, Karol Suchan & Ioan Todinca, Minimal proper interval completions, Information Processing Letters, Vol. 106(5). Pp. 195-202, Elsevier. 2008. [URL]
[hal-02438090:1]
Shenyuan Zhang, J. Ashot Kozak, Weihua Jiang, Andriy Yeromin, Jing Chen, Ying Yu, Aubin Penna, Wei Shen, Victor Chi & Michael Cahalan, Store-dependent and -independent Modes Regulating Ca 2+ Release-activated Ca 2+ Channel Activity of Human Orai1 and Orai3, Journal of Biological Chemistry, Vol. 283(25). Pp. 17662-17671, American Society for Biochemistry and Molecular Biology. 06. 2008. [URL]


Revue nationale sans comité de lecture


[inria-00336368:1]
Bruno Raffin & Christian Blonz, Grimage : une plate-forme d'interactions 3D sans marqueurs, Interstices, INRIA. 2008. [URL]


Chapitres d'ouvrages scientifiques


[hal-00460664:1]
Mohamad Al Hajj Hassan & Mostafa Bamha, Parallel Processing of Group-By Join Queries on Shared Nothing Machines, in Software and Data Technologies, Extended and revised -ICSOFT'2006 Best papers- Book, Boris Shishkov Joaquim Filipe and Markus Helfert (Ed.), Communications in Computer and Information Science;. Pp. 230-241, Springer Berlin Heidelberg. 2008. [URL]
[hal-00288449:1]
Pierre-Alain Fayolle, Alexander Pasko, Elena Kartasheva, Christophe Rosenberger & Christian Toinard, Automation of the Volumetric Models Construction, in Lecture Notes in Computer Science. Pp. 214-238, Springer-Verlag. 06. 2008. [URL]
[inria-00466166:1]
Frédéric Loulergue & Alexander Tiskin, Special issue on High-Level Parallel Programming and Applications, F. Loulergue and A. Tiskin (Ed.), Vol. Parallel Processing Letters, 18(1). Pp. 188, World Scientific Publishing. 2008. [URL]


Thèses et Habilitations à Diriger des Recherches


[tel-00491193:1]
Barbara Fila, Automates pour l'analyse de documents XML compressés, applications à la sécurité d'accès, Thèse de Doctorat. Université d'Orléans. 11. 2008. [URL]


Conférence donnée sur invitation


[inria-00449563:1]
Siva Anantharaman, Compression vs Queryability - A Case Study, in Dagstuhl Seminar 08621, Structure-Based Compression of Complex Massive Data. Dagstuhl, Germany, Structure-Based Compression of Complex Massive Data. Pp. http://drops.dagstuhl.de/opus/volltexte/2008/1676. 06. 2008. [URL]


Communications avec actes dans un congrès international


[hal-00460656:1]
Mohamad Al Hajj Hassan & Mostafa Bamha, Pipelined Parallelism in Multi-Join Queries on Heterogeneous Shared Nothing Architectures, in (ICSOFT'2008), Proceedings of the Third International Conference on Software and Data Technologies, José Cordeiro and Boris Shishkov and Alpesh Ranchordas and Markus Helfert (Ed.). Porto, Portugal, Vol. Volume PL/DPS/KEICSOFT (PL/DPS/KE). Pp. 127-134, INSTICC Press. 07. 2008. [URL]
[hal-00466763:1]
Marco Benedetti, Arnaud Lallouet & Jeremie Vautard, Modeling Adversary Scheduling with QCSP+, in SAC 2008, Proceedings of the 23rd Annual ACM Symposium on Applied Computing. Vila Galé, Brazil. 2008. [URL]
[hal-00466768:1]
Marco Benedetti, Arnaud Lallouet & Jeremie Vautard, A Proposal for Multilevel Constraint Programming, in MCO 2008, Proceedings of the 2nd international conference on Modelling, Computation and Optimization in Information Systems and Management Sciences. Metz, France. 2008. [URL]
[hal-00466771:1]
Marco Benedetti, Arnaud Lallouet & Jeremie Vautard, Quantified Constraint Optimization, in Proceedings of the 14th international conference on Principles and Practice of Constraint Programming. Sydney, Australia, Vol. 5202, Springer. 2008. [URL]
[hal-00563293:1]
Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam & Olga Kouchnarenko, Handling Left-Quadratic Rules When Completing Tree Automata, in 2nd Workshop on Reachability Problems in Computational Models - RP'08, RP'08 proceedings, Workshop on Reachability Problems in Computational Models. Liverpool, United Kingdom, Electronic Notes in Theoretical Computer Science, Vol. 223. Pp. 61-70, Elsevier. 09. 2008. [URL]
[hal-00451804:1]
Jérémy Briffaut, Jean-François Lalande & Waleed Smari, Team-based MAC policy over Security-Enhanced Linux, in SECURWARE '08, Second International Conference on Emerging Security Information, Systems and Technologies, IARIA (Ed.). Cap Esterel, France, ISBN: 978-0-7695-3329-2. Pp. 41 - 46, IEEE Computer Society. 08. 2008. [URL]
[hal-00447542:1]
Jérémy Briffaut, Jean-François Lalande & Christian Toinard, A proposal for securing a large-scale high-interaction honeypot, in Workshop on Security and High Performance Computing Systems, The 2008 High Performance Computing & Simulation Conference, Ratan Kumar Guha and Luca Spalazzi (Ed.). Cyprus, Cyprus. Pp. 206-212, IEEE Computer Society. 06. 2008. [URL]
[hal-00468333:1]
Jean-Michel Couvreur & Duy Tung Nguyen, Tree Data Decision Diagrams, in Verification and Evaluation of Computer and Communication System. Leeds, United Kingdom. Pp. 0-0. 07. 2008. [URL]
[hal-00466003:1]
Gaël Dias, Raycho Mukelov & Guillaume Cleuziou, Mapping General-Specific Noun Relationships to WordNet Hypernym/Hyponym Relations, in 16th International Conference on Knowledge Engineering and Knowledge Management Knowledge Patterns (EKAW'2008). Pp. 198-212. 2008. [URL]
[hal-00466007:1]
Gaël Dias, Raycho Mukelov & Guillaume Cleuziou, Fully Unsupervised Graph-Based Discovery of General-Specific Noun Relationships from Web Corpora Frequency Counts, in 12th Conference on Computational Natural Language Learning (CoNLL'2008). Pp. 97-104. 2008. [URL]
[hal-00466013:1]
Gaël Dias, Raycho Mukelov & Guillaume Cleuziou, Unsupervised Learning of General-Specific Noun Relations from the Web, in 21th International FLAIRS Conference (FLAIRS'2008). Pp. 147-152. 2008. [URL]
[hal-00460808:1]
Khalil Djelloul, An efficient decision procedure for functional decomposable theories based on dual constraints, in CSCLP 2008., Recent advances in constraints, revised selected paper, LNAI, Vol. 5655(5655). Pp. 33-50, Springer. 04. 2008. [URL]
[hal-00460813:1]
Khalil Djelloul, A full first-order constraint solver for decomposable theories, in International Conference on Artificial Intelligence and Symbolic Computation, lecture notes in computer sciences, Vol. 5144. Pp. vol (5144):93-108. 08. 2008. [URL]
[hal-00460817:1]
Khalil Djelloul, Combination of decomposability and propagation for solving first-order constraints in decomposable theories., in ACM Symposium on Applied computing, ACM press. Pp. 1728-1732. 03. 2008. [URL]
[hal-00448746:1]
Jérôme Durand-Lose, Abstract geometrical computation with accumulations: Beyond the Blum, Shub and Smale model, in 4th Conf. Computability in Europe (CiE'08) (abstracts and extended abstracts of unpublished papers), Logic and Theory of Algorithms, Arnold Beckmann and Costas Dimitracopoulos and Benedikt Löwe (Ed.). Pp. 107-116, University of Athens. 2008. [URL]
[inria-00448439:1]
Jérôme Durand-Lose, Small Turing universal signal machines, in WCSP'08s, International Workshop on the Complexity of Simple Program, Turlough Neary and Anthony Seda and Damien Woods (Ed.). Cork, Ireland. Pp. 89-102, Cork University Press. 12. 2008. [URL]
[inria-00448440:1]
Jérôme Durand-Lose, Black hole computation: implementation with signal machines, in IW PC, International Workshop Physics and Computation, C. S. Calude and J. F. Costa (Ed.). Wien, Austria. Pp. 136-158. 2008. [URL]
[hal-00464341:1]
Sylvain Jubertie, Emmanuel Melin, Jeremie Vautard & Arnaud Lallouet, Mapping Heterogeneous Distributed Applications on Clusters., in Euro-Par 2008, Euro-Par 2008 -- Parallel Processing. Las Palmas de Gran Canaria, Spain. Pp. 192-201. 08. 2008. [URL]
[hal-01123654:1]
Vincent Levorato & Marc Bui, Data Structures and Algorithms for Pretopology: The Java Based Software Library Pretopolib, in I2CS, Schoelcher. -, Martinique. Pp. 205-216. 06. 2008. [URL]
[hal-00480725:1]
Laurent Lyaudet & Uffe Flarup, On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract), in Computer Science Symposium in Russia (CSR 2008), Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia (CSR 2008), LNCS, Vol. 5010. Pp. 180-193. 2008. [URL]
[inria-00423451:1]
Nicolas Nisse & Karol Suchan, Fast Robber in Planar Graphs, in International Workshop on Graph-Theoretic Concepts in Computer Science (WG). Durham, United Kingdom. 2008. [URL]
[hal-00466402:1]
Damien Poirier, Cécile Bothorel, Emilie Guimier de Neef & Marc Boullé, Automating opinion analysis in film reviews : the case of statistic versus linguistic approach, in Language Resources and Evaluation Conference 2008, Proceedings of the LREC 2008. Pp. Pages 94-101. 05. 2008. [URL]
[hal-00462308:1]
Ivan Rapaport, Karol Suchan, Ioan Todinca & Jacques Verstraëte, On Dissemination Thresholds in Regular and Irregular Graph Classes, in LATIN 2008: Theoretical Informatics, Loana Tito Nogueira Luerbio Faria Eduardo Sany Laber, Claudson F. Bornstein (Ed.). Buzios, Brazil, Lecture Notes in Computer Science, Vol. 4957. Pp. 24-35, Springer. 04. 2008. [URL]
[hal-00459822:1]
Jonathan Rouzaud-Cornabas, Patrice Clemente & Christian Toinard, Correlation of system events: High performance classification of selinux activities and scenarios, in Workshop on Security and High Performance Computing Systems, The 2008 High Performance Computing & Simulation Conference. Cyprus, Cyprus. Pp. 171-177, INSPEC. 06. 2008. [URL]
[hal-00460933:1]
Lorenza Saitta & Christel Vrain, A Comparison between Two Statistical Relational Models, in ILP 08 - Inductive Logic Programming Conference, Inductive Logic Programming, 18th International Conference, Filip Zelezny et Nada Lavrac (Ed.). Prague, Czech Republic, Lecture Notes in Computer Science, Vol. 5194. Pp. 244-260, Springer. 2008. [URL]
[inria-00432575:1]
David Teller, Arnaud Spiwack & Till Varoquaux, Catch me if you can Looking for type-safe, hierarchical, lightweight, polymorphic and efficient error management in OCaml, in IFL 2008. Hertfordshire, United Kingdom. Pp. 21 p.. 09. 2008. [URL]
[hal-00468755:1]
Jérémie Vautard, Unblockable QCSP+ : a special case of quantified problems, in Second International Workshop on Quantification in Constraint Programming. Sydney, Australia. 09. 2008. [URL]


Communications avec actes dans un congrès national


[inria-00290945:1]
Marco Benedetti, Arnaud Lallouet & Jeremie Vautard, Modélisation de problèmes d'ordonnancement avec adversaire en QCSP+, in JFPC 2008- Quatrièmes Journées Francophones de Programmation par Contraintes, Gilles Trombettoni (Ed.). Nantes, France. Pp. 87-94. 06. 2008. [URL]
[hal-00466038:1]
Guillaume Cleuziou & Gaël Dias, Apprentissage de mesures de similarité sémantiques : étude d'une variante de la mesure InfoSimba, in first joint meeting of the Société Francophone de Classification and the Classification and Data Analysis Group of the Italian Statistical Society. Pp. 233-236. 2008. [URL]
[hal-00466059:1]
Guillaume Cleuziou & Céline Poudat, Classification de textes en domaines et en genres en combinant morphosyntaxe et lexique, in Défi Fouille de Textes (TALN'2008). 2008. [URL]
[hal-00466041:1]
Guillaume Cleuziou & Jacques-Henri Sublemontier, Etude comparative de deux approches de classification recouvrante : Moc vs. Okm, in 8èmes journées d'Extraction et de Gestion des Connaissances (EGC'2008). Pp. 667-678. 2008. [URL]
[hal-00466065:1]
Gaël Dias, Raycho Mukelov & Guillaume Cleuziou, Semantic Similarities and General-Specific Noun Relations from the web, in Atelier ''Mesures de Similarité Sémantique'' (EGC'2008). 2008. [URL]
[inria-00294886:1]
Khalil Djelloul, Combinaison de la propagation et de la décomposabilité pour la résolution de contraintes du premier ordre, in JFPC 2008- Quatrièmes Journées Francophones de Programmation par Contraintes, Gilles Trombettoni (Ed.). Nantes, France. Pp. 349-360. 06. 2008. [URL]
[hal-00274005:1]
Jérôme Durand-Lose, The signal point of view: from cellular automata to signal machines, in JAC 2008, Proceedings of the First Symposium on Cellular Automata ''Journées Automates Cellulaires'', Bruno Durand (Ed.). Uzès, France, Exploratory paper track. Pp. 238-249, 041804370434043004420435043b044c044104420432043e 041c0426041d041c041e. 04. 2008. [URL]
[hal-00464344:1]
Sylvain Jubertie, Emmanuel Melin, Jeremie Vautard & Arnaud Lallouet, Placement d'applications interactives sur des architectures distribuées hétérogènes à l'aide de la programmation par contraintes, in Renpar 08, Actes des 18e Rencontres Francophones du Parallélisme. Fribourg, Switzerland. 02. 2008. [URL]
[inria-00374450:1]
Nicolas Nisse & Karol Suchan, Voleur véloce dans un réseau planaire, in 10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), David Simplot-Ryl and Sebastien Tixeuil (Ed.). Saint-Malo, France. Pp. 29-32. 2008. [URL]
[hal-00466395:1]
Damien Poirier, Cécile Bothorel & Marc Boullé, Analyse exploratoire d'opinions cinématographiques : co-clustering de corpus textuels communautaires, in EGC'08, Extraction et gestion des connaissances : EGC'2008. Pp. Pages 565-576. 01. 2008. [URL]
[hal-00459825:1]
Jonathan Rouzaud-Cornabas, Une architecture de bureaux graphiques distants sécurisée et distribuée, in SSTIC 2008, Symposium sur la Sécurité des Technologies de l'Information et des Communications 2008. Rennes, France. Pp. 328-348. 06. 2008. [URL]


Communications affichées avec actes


[inria-00461654:1]
Simon Arvaux, Joeffrey Legaux, Sébastien Limet, Emmanuel Melin & Sophie Robert, Parallel LOD for static and dynamic generic geo-referenced data, in VRST, Proceedings of the ACM Symposium on Virtual Reality Software and Technology. Bordeaux, France. Pp. 301-302. 2008. [URL]
[hal-00466009:1]
Guillaume Cleuziou, An extended version of the k-means method for overlapping clustering, in 19th International Conference on Pattern Recognition (ICPR'2008). Pp. 1-4. 2008. [URL]
[hal-00469435:1]
Noman Javed & Frédéric Loulergue, A Metaprogrammed Bulk Synchronous Parallel Algorithmic Skeleton Library. 2008. [URL]
[inria-00461651:1]
Sébastien Limet & Sophie Robert, FlowVR-VRPN: first experiments of a VRPN/FlowVR coupling, in VRST, Proceedings of the ACM Symposium on Virtual Reality Software and Technology. Bordeaux, France. Pp. 251-252. 2008. [URL]


Communications sans actes


[inria-00330532:1]
Siva Anatharaman, Hai Lin, Chris Lynch, Paliath Narendran & Michael Rusinowitch, Active Intruders with Caps, in FCS-ARSPA-WITS'08. Pittsburgh, United States. 06. 2008. [URL]
[hal-00466125:1]
Jean-Luc Fouquet & Jean-Marie Vanherpe, Kaiser and Raspaud Conjecture on Cubic Graphs with few Vertices, in 17th 3in1 Workshop on Graph Theory, Proceedings of the 17th 3in1 Workshop on graph Theory. Krynica, Poland, Vol. 30(2). Pp. xxx-yyy. 11. 2008. [URL]


Autres Publications


[inria-00321766:1]
Pascal Berthomé & Nicolas Nisse, A unified FPT Algorithm for Width of Partition Functions. Pp. 36. 2008. [URL]
[hal-00459794:1]
Jérémy Briffaut, Proposition d'un pot-de-miel haute-interaction à large-échelle, in Journée Informatique de la Région Centre, Les Journées Informatique de la Région Centre. Orléans, France. Pp. 5-8. 10. 2008. [URL]
[hal-00264104:1]
Jean-Luc Fouquet & Jean-Marie Vanherpe, On $(P5,textbackslashoverlineP5)$-sparse graphs and other families. 01. 2008. [URL]
[hal-00325258:1]
Jean-Luc Fouquet & Jean-Marie Vanherpe, On Fan Raspaud Conjecture. 01. 2008. [URL]
[inria-00342279:1]
Rémi Gilleron, Florent Jousse, Marc Tommasi & Isabelle Tellier, Conditional Random Fields for XML Applications. 2008. [URL]
[hal-00468481:1]
David Teller, Extrapol: Dependent Types and Effects for System Security. Pp. Rapport de Recherche LIFO 2008-12-04, 50 pages. 12. 2008. [URL]



2024/04/18 généré via HALLO + JabRef.