Search the dblp DataBase

Publications of Author

1. Josee Desharnais, François Laviolette, Krishna Priya Darsini Moturu, Sami Zhioua
   Trace Equivalence Characterization Through Reinforcement Learning. [Citation Graph (0, 0)][DBLP]
   Canadian Conference on AI, 2006, pp:371-382 [Conf]
   
2. Massih-Reza Amini, Nicolas Usunier, François Laviolette, Alexandre Lacasse, Patrick Gallinari
   A Selective Sampling Strategy for Label Ranking. [Citation Graph (0, 0)][DBLP]
   ECML, 2006, pp:18-29 [Conf]
   
3. François Laviolette, Mario Marchand, Mohak Shah
   Margin-Sparsity Trade-Off for the Set Covering Machine. [Citation Graph (0, 0)][DBLP]
   ECML, 2005, pp:206-217 [Conf]
   
4. Josee Desharnais, François Laviolette, Sami Zhioua
   Testing Probabilistic Equivalence Through Reinforcement Learning. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2006, pp:236-247 [Conf]
   
5. François Laviolette, Mario Marchand
   PAC-Bayes risk bounds for sample-compressed Gibbs classifiers. [Citation Graph (0, 0)][DBLP]
   ICML, 2005, pp:481-488 [Conf]
   
6. François Laviolette, Mario Marchand, Mohak Shah
   A PAC-Bayes approach to the Set Covering Machine. [Citation Graph (0, 0)][DBLP]
   NIPS, 2005, pp:- [Conf]
   
7. Marc Chastand, François Laviolette, Norbert Polat
   On constructible graphs, infinite bridged graphs and weakly cop-win graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:224, n:1-3, pp:61-78 [Journal]
   
8. Gena Hahn, François Laviolette, Norbert Sauer, Robert E. Woodrow
   On cop-win graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:258, n:1-3, pp:27-41 [Journal]
   
9. Benoit Larose, François Laviolette, Claude Tardif
   On Normal Cayley Graphs and Hom-idempotent Graphs. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1998, v:19, n:7, pp:867-881 [Journal]
   
10. Vincent Danos, Josee Desharnais, François Laviolette, Prakash Panangaden
    Bisimulation and cocongruence for probabilistic systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:4, pp:503-523 [Journal]
    
11. Gena Hahn, François Laviolette, Jozef Sirán
    Edge-Ends in Countable Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:70, n:2, pp:225-244 [Journal]
    
12. François Laviolette
    Decompositions of infinite graphs: I - bond-faithful decompositions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:94, n:2, pp:259-277 [Journal]
    
13. François Laviolette
    Decompositions of infinite graphs: Part II circuit decompositions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:94, n:2, pp:278-333 [Journal]
    
14. Alexandre Lacasse, François Laviolette, Mario Marchand, Pascal Germain, Nicolas Usunier
    PAC-Bayes Bounds for the Risk of the Majority Vote and the Variance of the Gibbs Classifier. [Citation Graph (0, 0)][DBLP]
    NIPS, 2006, pp:769-776 [Conf]
    
15. Pascal Germain, Alexandre Lacasse, François Laviolette, Mario Marchand
    A PAC-Bayes Risk Bound for General Loss Functions. [Citation Graph (0, 0)][DBLP]
    NIPS, 2006, pp:449-456 [Conf]
    
16. François Laviolette, Norbert Polat
    Spanning trees of countable graphs omitting sets of dominated ends. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:151-172 [Journal]
    
17. François Laviolette
    Decomposition of infinite eulerian graphs with a small number of vertices of infinite degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:130, n:1-3, pp:83-87 [Journal]
    
18. 
    A Stochastic Point-Based Algorithm for POMDPs. [Citation Graph (, )][DBLP]
    
    
19. 
    Selective Sampling for Classification. [Citation Graph (, )][DBLP]
    
    
20. 
    Distribution-Dependent PAC-Bayes Priors. [Citation Graph (, )][DBLP]
    
    
21. 
    A Demonic Approach to Information in Probabilistic Systems. [Citation Graph (, )][DBLP]
    
    
22. 
    PAC-Bayesian learning of linear classifiers. [Citation Graph (, )][DBLP]
    
    
23. 
    A Transductive Bound for the Voted Classifier with an Application to Semi-supervised Learning. [Citation Graph (, )][DBLP]
    
    
24. 
    Learning the Difference between Partially Observable Dynamical Systems. [Citation Graph (, )][DBLP]
    
    
25. 
    Learning with Randomized Majority Votes. [Citation Graph (, )][DBLP]
    
    
26. 
    Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games. [Citation Graph (, )][DBLP]
    
    
27. 
    The Countable Character of Uncountable Graphs. [Citation Graph (, )][DBLP]