Christophe Costa Florêncio

发表

On families of categorial grammars of bounded value, their learnability and related complexity questions

Henning Fernau, Christophe Costa Florêncio, 2012, Theor. Comput. Sci..

Languages as Hyperplanes: Grammatical Inference with String Kernels

Alexander Clark, Christophe Costa Florêncio, Chris Watkins, 2006, ECML.

Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time

Jan Van den Bussche, Jan Ramon, Dries Van Dyck, 2015, J. Univers. Comput. Sci..

Regular inference as vertex coloring

Sicco Verwer, Christophe Costa Florêncio, C. C. Florêncio, 2012, Theor. Comput. Sci..

A Note on the Complexity of Associative-Commutative Lambek Calculus

Christophe Costa Florêncio, 2002, TAG+.

Proceedings of the KDD-09 Workshop on Statistical and Relational Learning in Bioinformatics

Joost N. Kok, Christophe Costa Florêncio, Fabrizio Costa Jan Ramon, 2009, KDD 2009.

Languages as hyperplanes: grammatical inference with string kernels

Alexander Clark, Christophe Costa Florêncio, Chris Watkins, 2010, Machine Learning.

StReBio'09: statistical relational learning and mining in bioinformatics

Jan Ramon, Joost N. Kok, Fabrizio Costa, 2010, SKDD.

Preface

Jan Ramon, Joost N. Kok, Christophe Costa Florêncio, 2011, Fundam. Informaticae.

Planar Languages and Learnability

Alexander Clark, Christophe Costa Florêncio, Chris Watkins, 2006, ICGI.

Proceedings of the 8th International Colloquium on Grammatical Inference (ICGI)

Chris Watkins, Christophe Costa Florêncio, Andrew G. Clark, 2006 .

Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach

Henning Fernau, Christophe Costa Florêncio, 2010, LATA.

Maximizing Component Quality in Bilingual Word-Aligned Segmentations

Christof Monz, Christophe Costa Florêncio, Spyros Martzoukos, 2014, EACL.

Regular Inference as Vertex Coloring

Sicco Verwer, Christophe Costa Florêncio, 2012, ALT.

Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard

Christophe Costa Florêncio, 2002, ICGI.

Consistent identification in the limit of some of Penn and Buszkowski's classes is NP-hard

Christophe Costa Florêncio, 1999, CLIN.

Investigating Connectivity and Consistency Criteria for Phrase Pair Extraction in Statistical Machine Translation

Christof Monz, Christophe Costa Florêncio, Spyros Martzoukos, 2013, MOL.

On the Complexity of Consistent Identification of Some Classes of Structure Languages

Christophe Costa Florêncio, 2000, ICGI.

Proceedings of the ACM SIGKDD Workshop on Statistical and Relational Learning in Bioinformatics, Paris, France, June 28, 2009

Jan Ramon, Joost N. Kok, Fabrizio Costa, 2009, KDD Workshop on Statistical and Relational Learning in Bioinformatics.

Learning Tree Adjoining Grammars from Structures and Strings

Christophe Costa Florêncio, 2012, ICGI.

Learning Node Label Controlled Graph Grammars (Extended Abstract)

Christophe Costa Florêncio, 2008, ICGI.

Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard

Christophe Costa Florêncio, 2001, LACL.

Proceedings of the European Conference on Machine Learning (ECML)

Chris Watkins, Christophe Costa Florêncio, Chris Watkins, 2006 .

Tree Planar Languages

Christophe Costa Florêncio, 2007, Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007).

Conservative vs Set-driven Learning Functions for the Classes k-valued

Christophe Costa Florêncio, 2001, CLIN.

Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG

Henning Fernau, Christophe Costa Florêncio, 2010, ICGI.

Rigid grammars in the Associative-Commutative Lambek Calculus are not learnable

Christophe Costa Florêncio, C. C. Florêncio, 2003, EACL.

Learning generalized quantifiers

Christophe Costa Florêncio, 2002 .

Machine Learning in Bioinformatics: preface

Jan Ramon, Joost N. Kok, Fabrizio Costa, 2011 .

Learning categorial grammars

Christophe Costa Florêncio, C. C. Florêncio, 2003 .