- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j5 |      | Victor Mitrana, Cristina Tîrnauca: New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries. Acta Inf. 48(1): 43-50 (2011) |
| j4 | | Tom Diethe, José L. Balcázar, John Shawe-Taylor, Cristina Tîrnauca: Preface. Journal of Machine Learning Research - Proceedings Track 17: 1-4 (2011) |
| c8 |  | José L. Balcázar, Cristina Tîrnauca: Closed-set-based Discovery of Representative Association Rules Revisited. EGC 2011: 635-646 |
| c7 | | José L. Balcázar, Cristina Tîrnauca: Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices. ICFCA 2011: 49-64 |
| 2010 | ||
| c6 | | José L. Balcázar, Cristina Tîrnauca, Marta E. Zorrilla: Filtering Association Rules with Negations on the Basis of Their Confidence Boost. KDIR 2010: 263-268 |
| c5 | | Cristina Tîrnauca, Catalin Ionut Tîrnauca: Types of Trusted Information That Make DFA Identification with Correction Queries Feasible. CIAA 2010: 272-281 |
| i2 | | José L. Balcázar, Cristina Tîrnauca: Closed-set-based Discovery of Representative Association Rules Revisited. CoRR abs/1012.0735 (2010) |
| i1 | | José L. Balcázar, Cristina Tîrnauca: Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices. CoRR abs/1012.0742 (2010) |
| 2009 | ||
| j3 | | Carlos Martín-Vide, Cristina Tîrnauca: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008). Inf. Comput. 207(11): 1095 (2009) |
| j2 | | Cristina Tîrnauca, Satoshi Kobayashi: Necessary and sufficient conditions for learning with correction queries. Theor. Comput. Sci. 410(47-49): 5145-5157 (2009) |
| 2008 | ||
| c4 | | Cristina Tîrnauca: A Note on the Relationship between Different Types of Correction Queries. ICGI 2008: 213-223 |
| 2007 | ||
| j1 | | Catalin Ionut Tîrnauca, Cristina Tîrnauca: Learning Regular Tree Languages from Correction and Equivalence Queries. Journal of Automata, Languages and Combinatorics 12(4): 501-524 (2007) |
| c3 | | Cristina Tîrnauca, Timo Knuutila: Polynomial Time Algorithms for Learning k -Reversible Languages and Pattern Languages with Correction Queries. ALT 2007: 272-284 |
| c2 | | Cristina Tîrnauca, Satoshi Kobayashi: A Characterization of the Language Classes Learnable with Correction Queries. TAMC 2007: 398-407 |
| 2006 | ||
| c1 | | Leonor Becerra-Bonache, Adrian Horia Dediu, Cristina Tîrnauca: Learning DFA from Correction and Equivalence Queries. ICGI 2006: 281-292 |
Colors in the list of coauthors
Last update Sun May 19 16:52:13 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page