Sciweavers

ICML
1999
IEEE
15 years 9 days ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
ICIP
2007
IEEE
15 years 1 months ago
Faithful Shape Representation for 2D Gaussian Mixtures
It has been recently discovered that a faithful representation for the shape of some simple distributions can be constructed using invariant statistics [1, 2]. In this paper, we c...
Mireille Boutin, Mary I. Comer