Articles dans des revues avec comité de lecture (Refereed journal articles)

1. V. Danos, J. Desharnais, F. Laviolette et P. Panangaden. Bisimulation and Cocongruence for Probabilistic Systems, Information and Computation, 204-4 (2006) 503-523.    PDF(draft)
   
   
2. F. Laviolette. Decomposition of Infinite Graphs: PartII – Circuit Decompositions, J. Combin. Theory Ser. B, 94 (2005), 278-333.    PDF(draft)
   
   
3. F. Laviolette. Decomposition of Infinite Graphs: PartI – Bond-faithful Decompositions, J. Combin. Theory Ser. B, 94 (2005), 259-277.   PDF(draft)
   
   
4. G. Hahn, F. Laviolette, N. Sauer et R. E. Woodrow, On Cop-Win Graphs, Discrete Math.,258 (2002), 27-41.    PDF(draft)
   
   
5. M. Chastand, F. Laviolette, N. Polat, On Constructible Graphs and Infinite Bridged Graphs, Discrete Math. 224 (2000), 61-78.    PDF(draft)
   
   
6. F. Laviolette, N. Polat, Spanning Trees of Countable Graphs Omitting Sets of Dominated Ends, Discrete Math. 194 (1999), 151-172. PDF(draft)
   
   
7. B. Larose, F. Laviolette et C. Tardif, On Normal Cayley Graphs and Hom-idempotent Graphs, Europ. J. Combin Theory, 19 (1998), 867-881.    PDF(draft)
   
   
8. G. Hahn, F. Laviolette et J. Širán, Edge-ends in Countable Graphs, J. Combin. Theory Ser. B, 70 (1997), 225-244.    PDF(draft)
   
   
9. F. Laviolette, Decomposition of Infinite Eulerian Graphs with a Small Number of Vertices of Infinite Degree, Discrete Math. 130 (1994), 83-87.    PDF(draft)
   
   
10. M. Bélanger, M. De Serres, F. Laviolette, A.-M. Lorrain, V. Papillon, Analyse et Calcul I, Modulo Éditeur, Ville Mont-Royal, 1995, ISBN2-89113-615-2.
    
    
    
    
    

Articles de conférences avec comité de lecture (Referred conference proceedings)

1. F. Laviolette, S. Zhioua, Testing Stochastic Processes through Reinforcement Learning, accepted in NIPS'06 workshop on "Testing of Deployable Learning & Decision Systems", Kiri Wagstaff, Chris Drummond and Dragos Margineantu (Eds), 2006, 8 pages.
   PDF(draft)          Presentation.ppt
   
   
2. A. Lacasse, F. Laviolette, M. Marchand, P. Germain and N. Usunier. PAC-Bayes Bounds for the Risk of the Majority Vote and the Variance of the Gibbs Classifier, Accepted for publication in Advances in Neural Information Processing Systems. MIT Press, Cambridge, MA, 2006, 8 pages.
   Oral presentation acceptance rate : 8%.   
   PDF(draft)  -- (For a long version, please contact me)          Presentation.ppt
   
   
3. P. Germain, A. Lacasse, F. Laviolette and M. Marchand. PAC-Bayes Risk Bounds for General Loss Functions, Accepted for publication in Advances in Neural Information Processing Systems. MIT Press, Cambridge, MA, 2006, 8 pages.
   Acceptance rate : 24%.   
   PDF(draft)          Presentation.ppt
   
   
4. J. Desharnais, F. Laviolette and S. Zhioua. Testing Probabilistic Equivalence through Reinforcement Learning, accepted for publication in Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Sciences, 2006, 12 pages.
   Acceptance rate : 22%.
   PDF(draft)  --  (For a long version, please contact me)
   
   
5. M. Amini, N. Usunier, F. Laviolette, A. Lacasse and P. Gallinari, A Selective Sampling Strategy for Label-Ranking, Proceedings of the 17th European Conference on Machine Learning (ECML 2006), J. Fürnkranz, T. Scheffer, and M. Spiliopoulou (Eds.), Lecture Notes in Artificial Intelligence, 4212, pp. 1829, 2006. Springer-Verlag Berlin Heidelberg 2006.
   Long paper Acceptance rate : 9%.
   PDF(draft)
   
   
6. J. Desharnais, F. Laviolette, K.P.D. Moturu and S. Zhioua. Trace Equivalence Characterization Through Reinforcement Learning, in Canadian AI 2006, L. Lamontagne and M. Marchand (Eds.), Lecture Notes in Artificial Intelligence 4013, pp. 371382, 2006. Springer-Verlag Berlin Heidelberg 2006.
   Acceptance rate : 30%.
   PDF(draft)
   
   
7. F. Laviolette, M. Marchand, and M. Shah. A PAC-Bayes Approach to the Set Covering Machine. In Y. Weiss, B. Schölkopf, and J. Platt, editors, Advances in Neural Information Processing Systems 18, pages 731-738. MIT Press, Cambridge, MA, 2006.
   Acceptance rate : 27%.
   PDF(draft)
   
   
8. F. Laviolette, M. Marchand, and M. Shah. Margin-sparsity Trade-off for the Set Covering Machine. Proceedings of the 16th European Conference on Machine Learning (ECML 2005); Lecture Notes in Artificial Intelligence, 3720 pages 206-217, 2005.
   Long paper Acceptance rate : 12%.
   PDF(draft)          Presentation.ppt
   
   
9. F. Laviolette et M. Marchand. PAC-Bayes Risk Bounds for Sample-Compressed Gibbs Classifiers. Proceedings of the 22nd International Conference on Machine Learning (ICML’05, Bonn, Germany.). pp. 481-488, ACM Press (2005).
   Acceptance rate : 29%.
   PDF(draft)          presentation.ppt
   
   
10. F. Laviolette, The Countable Character of Uncountable Graphs, Electronic Notes on Theoretical Computer Sciences, 87 (2004), 205-224.
    PDF(draft)          presentation.ppt