| 1999 |
|---|
| 9 | EE | Richard Nock,
Pascal Jappy:
A ``Top-Down and Prune'' Induction Scheme for Constrained Decision Committees.
IDA 1999: 27-38 |
| 8 | | Richard Nock,
Marc Sebban,
Pascal Jappy:
Experiments on a Representation-Independent "Top-Down and Prune" Induction Scheme.
PKDD 1999: 223-231 |
| 7 | EE | Richard Nock,
Pascal Jappy:
Decision tree based induction of decision lists.
Intell. Data Anal. 3(3): 227-240 (1999) |
| 1998 |
|---|
| 6 | EE | Pascal Jappy,
Richard Nock:
PAC Learning Conceptual Graphs.
ICCS 1998: 303-318 |
| 5 | | Richard Nock,
Pascal Jappy:
On the Power of Decision Lists.
ICML 1998: 413-420 |
| 4 | | Richard Nock,
Pascal Jappy:
Function-Free Horn Clauses Are Hard to Approximate.
ILP 1998: 195-204 |
| 3 | EE | Richard Nock,
Pascal Jappy,
Jean Sallantin:
Generalized Graph Colorability and Compressibility of Boolean Formulae.
ISAAC 1998: 237-246 |
| 1996 |
|---|
| 2 | | Pascal Jappy,
Richard Nock,
Olivier Gascuel:
Negative Robust Learning Results from Horn Claus Programs.
ICML 1996: 258-265 |
| 1994 |
|---|
| 1 | | Pascal Jappy,
Marie-Catherine Daniel-Vatonne,
Olivier Gascuel,
Colin de la Higuera:
Learning from Recursive, Tree Structured Examples.
ECML 1994: 367-370 |
