2008 |
22 | EE | François Laviolette,
Mario Marchand,
Sara Shanian:
Selective Sampling for Classification.
Canadian Conference on AI 2008: 191-202 |
21 | EE | François Laviolette,
Ludovic Tobin:
A Stochastic Point-Based Algorithm for POMDPs.
Canadian Conference on AI 2008: 332-343 |
20 | EE | Massih-Reza Amini,
François Laviolette,
Nicolas Usunier:
A Transductive Bound for the Voted Classifier with an Application to Semi-supervised Learning.
NIPS 2008: 65-72 |
19 | EE | Josée Desharnais,
François Laviolette,
Mathieu Tracol:
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games.
QEST 2008: 264-273 |
2006 |
18 | EE | Josee Desharnais,
François Laviolette,
Krishna Priya Darsini Moturu,
Sami Zhioua:
Trace Equivalence Characterization Through Reinforcement Learning.
Canadian Conference on AI 2006: 371-382 |
17 | EE | Massih-Reza Amini,
Nicolas Usunier,
François Laviolette,
Alexandre Lacasse,
Patrick Gallinari:
A Selective Sampling Strategy for Label Ranking.
ECML 2006: 18-29 |
16 | EE | Josee Desharnais,
François Laviolette,
Sami Zhioua:
Testing Probabilistic Equivalence Through Reinforcement Learning.
FSTTCS 2006: 236-247 |
15 | EE | Pascal Germain,
Alexandre Lacasse,
François Laviolette,
Mario Marchand:
A PAC-Bayes Risk Bound for General Loss Functions.
NIPS 2006: 449-456 |
14 | EE | 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.
NIPS 2006: 769-776 |
13 | EE | Vincent Danos,
Josee Desharnais,
François Laviolette,
Prakash Panangaden:
Bisimulation and cocongruence for probabilistic systems.
Inf. Comput. 204(4): 503-523 (2006) |
2005 |
12 | EE | François Laviolette,
Mario Marchand,
Mohak Shah:
Margin-Sparsity Trade-Off for the Set Covering Machine.
ECML 2005: 206-217 |
11 | EE | François Laviolette,
Mario Marchand:
PAC-Bayes risk bounds for sample-compressed Gibbs classifiers.
ICML 2005: 481-488 |
10 | EE | François Laviolette,
Mario Marchand,
Mohak Shah:
A PAC-Bayes approach to the Set Covering Machine.
NIPS 2005 |
9 | EE | François Laviolette:
Decompositions of infinite graphs: I - bond-faithful decompositions.
J. Comb. Theory, Ser. B 94(2): 259-277 (2005) |
8 | EE | François Laviolette:
Decompositions of infinite graphs: Part II circuit decompositions.
J. Comb. Theory, Ser. B 94(2): 278-333 (2005) |
2004 |
7 | EE | François Laviolette:
The Countable Character of Uncountable Graphs.
Electr. Notes Theor. Comput. Sci. 87: 205-224 (2004) |
2002 |
6 | EE | Gena Hahn,
François Laviolette,
Norbert Sauer,
Robert E. Woodrow:
On cop-win graphs.
Discrete Mathematics 258(1-3): 27-41 (2002) |
2000 |
5 | EE | Marc Chastand,
François Laviolette,
Norbert Polat:
On constructible graphs, infinite bridged graphs and weakly cop-win graphs.
Discrete Mathematics 224(1-3): 61-78 (2000) |
1999 |
4 | EE | François Laviolette,
Norbert Polat:
Spanning trees of countable graphs omitting sets of dominated ends.
Discrete Mathematics 194(1-3): 151-172 (1999) |
1998 |
3 | EE | Benoit Larose,
François Laviolette,
Claude Tardif:
On Normal Cayley Graphs and Hom-idempotent Graphs.
Eur. J. Comb. 19(7): 867-881 (1998) |
1997 |
2 | EE | Gena Hahn,
François Laviolette,
Jozef Sirán:
Edge-Ends in Countable Graphs.
J. Comb. Theory, Ser. B 70(2): 225-244 (1997) |
1994 |
1 | EE | François Laviolette:
Decomposition of infinite eulerian graphs with a small number of vertices of infinite degree.
Discrete Mathematics 130(1-3): 83-87 (1994) |