Result 1 to 20 of 146 total
Regularity of languages defined by formal series with isolated cut point. (English)
RAIRO, Theor. Inform. Appl. 46, No. 4, 479-493 (2012).
1
Size constrained distance clustering: separation properties and some complexity results. (English)
Fundam. Inform. 115, No. 1, 125-139 (2012).
2
COSNet: A cost sensitive neural network for semi-supervised learning in graphs. (English)
Gunopulos, Dimitrios (ed.) et al., Machine learning and knowledge discovery in databases. European conference, ECML PKDD 2011, Athens, Greece, September 5‒9, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-23779-9/pbk). Lecture Notes in Computer Science 6911. Lecture Notes in Artificial Intelligence, 219-234 (2011).
3
Learning functional linkage networks with a cost-sensitive approach. (English)
Apolloni, Bruno (ed.) et al., Neural nets WIRN10. Proceedings of the 20th Italian workshop on neural nets, Vietri sul Mare, Italy, May 27‒29, 2010. Amsterdam: IOS Press (ISBN 978-1-60750-691-1/hbk; 978-1-60750-692-8/ebook). Frontiers in Artificial Intelligence and Applications 226, 52-61 (2011).
4
The inclusion problem of context-free languages: some tractable cases. (English)
Int. J. Found. Comput. Sci. 22, No. 2, 289-299 (2011).
5
A mathematical model for the validation of gene selection methods (English)
IEEE/ACM Trans. Comput. Biology Bioinform. 8, No. 5, 1385-1392 (2011).
6
Cosnet: A cost sensitive neural network for semi-supervised learning in graphs (English)
ECML/PKDD (1), 219-234 (2011).
7
Regularity of languages defined by formal series with isolated cut point (English)
NCMA, 73-87 (2011).
8
Trace monoids with idempotent generators and measure-only quantum automata. (English)
Nat. Comput. 9, No. 2, 383-395 (2010).
9
Grammatical compression: compressed equivalence and other problems (English)
Discrete Mathematics & Theoretical Computer Science 12, No. 4, 109-126 (2010).
10
Learning functional linkage networks with a cost-sensitive approach (English)
WIRN, 52-61 (2010).
11
The inclusion problem of context-free languages: some tractable cases. (English)
Diekert, Volker (ed.) et al., Developments in language theory. 13th international conference, DLT 2009, Stuttgart, Germany, June 30‒July 3, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02736-9/pbk). Lecture Notes in Computer Science 5583, 103-112 (2009).
12
Unsupervised stability-based ensembles to discover reliable structures in complex bio-molecular data. (English)
Masulli, Francesco (ed.) et al., Computational intelligence methods for bioinformatics and biostatistics. 5th international meeting, CIBB 2008, Vietri sul Mare, Italy, October 3‒4, 2008. Revised selected papers. Berlin: Springer (ISBN 978-3-642-02503-7/pbk). Lecture Notes in Computer Science 5488. Lecture Notes in Bioinformatics, 25-43 (2009).
13
The complexity of unary tiling recognizable picture languages: nondeterministic and unambiguous cases. (English)
Fundam. Inform. 91, No. 2, 231-249 (2009).
14
Charge-based solid-state flying qubits (English)
Encyclopedia of Complexity and Systems Science, 1011-1027 (2009).
15
The inclusion problem of context-free languages: some tractable cases (English)
Developments in Language Theory, 103-112 (2009).
16
Approximating the mean speedup in trace monoids. (English)
Int. J. Found. Comput. Sci. 19, No. 3, 497-511 (2008).
17
SOFSEM 2008: Theory and practice of computer science. 34th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 19‒25, 2008. Proceedings. (English)
Lecture Notes in Computer Science 4910. Berlin: Springer (ISBN 978-3-540-77565-2/pbk). xv, 792~p. EUR~93.09 (2008).
18
Classification of DNA microarray data with random projection ensembles of polynomial svms (English)
WIRN, 60-66 (2008).
19
Random projections preserving the Hamming distance between words (English)
WIRN, 148-153 (2008).
20
Result 1 to 20 of 146 total
Start
Contact
Print
General Help
