引用次数
引用: 221
H-指数: 9
I10-指数 : 9
出版物: 48
Identification of Hyperedge-Replacement graph grammars
Cristovao Costa Florencio ,
mining and learning with graphs 1 -3
3
2009
Unsupervised learning of graph languages using kernels
Cristovao Costa Florencio
mining and learning with graphs 155 -158
2007
Identification of NCE graph grammars
Cristovao Costa Florencio
Proceedings of Benelearn09, the 18th annual Belgian-Dutch conference on machine learning 115 -116
2009
Complexity of consistency in categorial grammars
Henning Fernau , Cristovao Costa Florencio
Theorietag Automaten und Formale Sprachen, Technical Report 2009/03 of the University Halle-Wittenberg, Institute of Computer Science 15 -17
2009
Inductive graph logic programming: Work in progress
Cristovao Costa Florencio ,
inductive logic programming 14 -19
2008
Graph grammars as language bias in graph mining
Cristovao Costa Florencio , Jan Ramon , Jonny Daenen , Jan Van den Bussche
mining and learning with graphs 1 -3
2009
Unsupervised learning of graph languages using kernels: New results
Cristovao Costa Florencio
KI 2007 Workshop on Learning from Non-Vectorial Data 1 -8
2007
Proceedings of the ECML/PKDD 2008 Workshop on Statistical and Relational Learning in Bioinformatics
Jan Ramon , Cristovao Costa Florencio , Fabrizio Costa , Joost Kok
status: published
2008
Languages as hyperplanes: grammatical inference with string kernels
Alexander Clark , Christophe Costa Florêncio , Chris Watkins
Machine Learning 82 ( 3) 351 -373
4
2011
D3. 2: Self-Learning Machine Translation Module
C Costa Florˆencio , Christof Monz , Spyros Martzoukos , Amit Bronner
2013
Languages as Hyperplanes
Alexander Clark , C Costa Florencio , C Watkins
Proceeding of European Conference on Machine Learning, ECML
1
2006
Consistent Identification in the Limit of Rigid Grammars from Strings is NP-hard
C. Costa Florêncio
Grammatical Inference: Algorithms and Applications 729 -733
20
2002
Learning generalized quantifiers
C. Costa Florêncio
Proceedings of Seventh ESSLLI Student Session
13
2002
Consistent identification in the limit of some Penn and Buszkowski’s classes is NP-hard
C. Costa Florêncio
Proceedings of the International Conference on Computational Linguistics
10
1999
A note on the complexity of the associative-commutative Lambek calculus
C. Costa Florêncio
Proceedings of the 6th Int’l Workshop on Tree Adjoining Grammar and Related Framework 101 -106
2
2002
Combinatory categorial grammars and finite elasticity
C. Costa Florêncio
2
2001
Conservative vs Set-driven Learning Functions for the Classes k-valued
C. Costa Florêncio
Language and Computers 45 ( 1) 38 -46
1
2002
A grammatical inference approach to learning from graphs
Cristophe Costa Florêncio
status: published
2009
Investigating Connectivity and Consistency Criteria for Phrase Pair Extraction in Statistical Machine Translation
Spyros Martzoukos , Christof Monz , Christophe Costa Florêncio
mathematics of language 93 -101
2
2013
Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time
Jan Van den Bussche , Jonny Daenen , Dries Van Dyck , Jan Ramon
Journal of Universal Computer Science 21 ( 7) 891 -911
5
2015