Christophe Costa Florêncio

26 papers A 2B 1C 1Journal 6Unranked 15
YearRankTypeTitle / Venue / Authors
2015 J jnl
Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time.
J. Univers. Comput. Sci.
Christophe Costa Florêncio, Jonny Daenen, Jan Ramon, Jan Van den Bussche, Dries Van Dyck
2014 A conf
Maximizing Component Quality in Bilingual Word-Aligned Segmentations.
EACL
Spyros Martzoukos, Christof Monz, Christophe Costa Florêncio
2014 J jnl
Regular inference as vertex coloring.
Theor. Comput. Sci.
Christophe Costa Florêncio, Sicco Verwer
2013 — conf
Investigating Connectivity and Consistency Criteria for Phrase Pair Extraction in Statistical Machine Translation.
MOL
Spyros Martzoukos, Christophe Costa Florêncio, Christof Monz
2012 — conf
Learning Tree Adjoining Grammars from Structures and Strings.
ICGI
Christophe Costa Florêncio
2012 J jnl
On families of categorial grammars of bounded value, their learnability and related complexity questions.
Theor. Comput. Sci.
Christophe Costa Florêncio, Henning Fernau
2012 B conf
Regular Inference as Vertex Coloring.
ALT
Christophe Costa Florêncio, Sicco Verwer
2011 J jnl
Languages as hyperplanes: grammatical inference with string kernels.
Mach. Learn.
Alexander Clark, Christophe Costa Florêncio, Chris Watkins
2011 J jnl
Preface.
Fundam. Informaticae
Jan Ramon, Fabrizio Costa, Christophe Costa Florêncio, Joost N. Kok
2010 C conf
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach.
LATA
Christophe Costa Florêncio, Henning Fernau
2010 — conf
Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG.
ICGI
Christophe Costa Florêncio, Henning Fernau
2009 — conf
Context-free Graph Grammars as a Language-bias Mechanism for Graph Pattern Mining.
MLG/SRL@ILP
Christophe Costa Florêncio, Jan Ramon, Jonny Daenen, Jan Van den Bussche, Dries Van Dyck
2009 — conf
Identification of Hyperedge-Replacement Graph Grammars.
MLG/SRL@ILP
Christophe Costa Florêncio
2009 — ed.
Proceedings of the ACM SIGKDD Workshop on Statistical and Relational Learning in Bioinformatics, Paris, France, June 28, 2009
KDD Workshop on Statistical and Relational Learning in Bioinformatics
Christophe Costa Florêncio, Fabrizio Costa, Jan Ramon, Joost N. Kok
2009 J jnl
StReBio'09: statistical relational learning and mining in bioinformatics.
SIGKDD Explor.
Jan Ramon, Fabrizio Costa, Christophe Costa Florêncio, Joost N. Kok
2008 — conf
Learning Node Label Controlled Graph Grammars (Extended Abstract).
ICGI
Christophe Costa Florêncio
2007 — conf
Tree Planar Languages.
ICDM Workshops
Christophe Costa Florêncio
2006 — conf
Languages as Hyperplanes: Grammatical Inference with String Kernels.
ECML
Alexander Clark, Christophe Costa Florêncio, Chris Watkins
2006 — conf
Planar Languages and Learnability.
ICGI
Alexander Clark, Christophe Costa Florêncio, Chris Watkins, Mariette Sérayet
2003 A conf
Rigid grammars in the Associative-Commutative Lambek Calculus are not learnable.
EACL
Christophe Costa Florêncio
2002 — conf
A Note on the Complexity of Associative-Commutative Lambek Calculus.
TAG+
Christophe Costa Florêncio
2002 — conf
Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard.
ICGI
Christophe Costa Florêncio
2001 — conf
Conservative vs Set-driven Learning Functions for the Classes k-valued.
CLIN
Christophe Costa Florêncio
2001 — conf
Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard.
LACL
Christophe Costa Florêncio
2000 — conf
On the Complexity of Consistent Identification of Some Classes of Structure Languages.
ICGI
Christophe Costa Florêncio
1999 — conf
Consistent identification in the limit of some of Penn and Buszkowski's classes is NP-hard.
CLIN
Christophe Costa Florêncio