Cristina Tîrnauca

According to our database1, Cristina Tîrnauca
  • authored at least 22 papers between 2006 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Learning definite Horn formulas from closure queries.
Theor. Comput. Sci., 2017

2016
Behavioral Modeling Based on Probabilistic Finite Automata: An Empirical Study.
Sensors, 2016

Model-driven regularization approach to straight line program genetic programming.
Expert Syst. Appl., 2016

Automatic Generation of User Interaction Models.
Proceedings of the Ubiquitous Computing and Ambient Intelligence, 2016

2015
Learning Propositional Horn Formulas from Closure Queries.
CoRR, 2015

Teaching a Virtual Robot to Perform Tasks by Learning from Observation.
Proceedings of the Ubiquitous Computing and Ambient Intelligence. Sensing, Processing, and Using Environmental Information, 2015

2011
Preface.
Proceedings of the Second Workshop on Applications of Pattern Analysis, 2011

New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries.
Acta Inf., 2011

Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices.
Proceedings of the Formal Concept Analysis - 9th International Conference, 2011

Closed-set-based Discovery of Representative Association Rules Revisited.
Proceedings of the Extraction et gestion des connaissances (EGC'2011), 2011

2010
Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices
CoRR, 2010

Closed-set-based Discovery of Representative Association Rules Revisited
CoRR, 2010

Types of Trusted Information That Make DFA Identification with Correction Queries Feasible.
Proceedings of the Implementation and Application of Automata, 2010

Filtering Association Rules with Negations on the Basis of Their Confidence Boost.
Proceedings of the KDIR 2010, 2010

Correction Queries in Active Learning.
Proceedings of the Scientific Applications of Language Methods., 2010

2009
Necessary and sufficient conditions for learning with correction queries.
Theor. Comput. Sci., 2009

2nd International Conference on Language and Automata Theory and Applications (LATA 2008).
Inf. Comput., 2009

2008
A Note on the Relationship between Different Types of Correction Queries.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

2007
Learning Regular Tree Languages from Correction and Equivalence Queries.
Journal of Automata, Languages and Combinatorics, 2007

A Characterization of the Language Classes Learnable with Correction Queries.
Proceedings of the Theory and Applications of Models of Computation, 2007

Polynomial Time Algorithms for Learning k -Reversible Languages and Pattern Languages with Correction Queries.
Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

2006
Learning DFA from Correction and Equivalence Queries.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2006


  Loading...