![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Acta Cybernetica, Volume 18
Volume 18, Number 1, 2007
- Ferenc Gécseg, György Turán:
Kalmár Workshop on Logic and Computer Science - Preface. 3-5 - András Hajnal:
In memory of László Kalmár. 7-8 - Árpád Makay:
The activities of László Kalmár in the world of information technology. 9-14 - Alexander S. Antonenko, Eugene L. Berkovich:
Groups and Semigroups Defined by some Classes of Mealy Automata. 23-46 - Edward G. Coffman Jr., János Csirik:
A Classification Scheme for Bin Packing Theory. 47-60 - Miguel Couceiro, Stephan Foldes:
Functional Equations, Constraints, Definability of Function Classes, and Functions of Boolean Variables. 61-75 - Giorgi Japaridze:
Intuitionistic computability logic. 77-113 - György Gyurica:
On monotone languages and their characterization by regular expressions. 117-134 - Alexander Meduna, Tomás Masopust:
Self-Regulating Finite Automata. 135-153 - István Babcsányi:
Automata with Finite Congruence Lattices. 155-165
Volume 18, Number 2, 2007
- Laszlo Csink, Tibor Gregorics, Bálint Molnár, Edit Sántáné-Tóth, Péter Szeredi, Zoltán Vámossy, László Zsolt Varga:
Symposium of Young Scientists on Intelligent Systems - Preface. 169 - Ervin Melkó, Benedek Nagy:
Optimal strategy in games with chance nodes. 171-192 - Zsolt Jankó, Dmitry Chetverikov, Anikó Ekárt:
Using Genetic Algorithms in Computer Vision: Registering Images to 3D Surface Model. 193-212 - Zoltán Szabó, András Lörincz:
Independent Subspace Analysis can Cope with the 'Curse of Dimensionality'. 213-221 - Péter Egri, József Váncza:
Cooperative Production Networks - Multiagent Modeling and Planning. 223-238 - Dávid Hanák, Nagarajan Kandasamy:
Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming. 239-255 - Péter Jeszenszky:
Adding XMP support to Firefox. 257-274 - Zoltán Alexin:
Conference on Hungarian Computational Linguistics - Preface. 277 - Domonkos Tikk, György Biró, Ferenc Szidarovszky, Zsolt Tivadar Kardkovács, Gábor Lemák:
Topic and language specific internet search engine. 279-291 - Dániel Varga, Eszter Simon:
Hungarian named entity recognition with a maximum entropy approach. 293-301 - Zoltán Szamonek, István Bíró:
Similarity Based Smoothing In Language Modeling. 303-314 - Judit Kuti, Károly Varasdi, Ágnes Gyarmati, Péter Vajda:
Hungarian WordNet and representation of verbal event structure. 315-328 - Miklós Szöts, Tamás Gröbler, András Simonyi:
How to Represent Meanings in an Ontology. 329-340 - Károly Varasdi, Zsófia Gyarmathy, András Simonyi, Dániel Szeredi:
Outlines of a Model of General Ontology. 341-354 - Gergely Feldhoffer, Tamás Bárdi:
Conversion of continuous speech sound to articulation animation as an application of visual coarticulation modeling. 355-362
Volume 18, Number 3, 2008
- Péter Balázs:
On the Ambiguity of Reconstructing hv-Convex Binary Matrices with Decomposable Configurations. 367-377 - András Bánhalmi, András Kocsor:
An On-line Speaker Adaptation Method for HMM-based Speech Recognizers. 379-390 - Róbert Busa-Fekete, András Kocsor:
Extracting Human Protein Information from MEDLINE Using a Full-Sentence Parser. 391-402 - Gergely Dévai:
Programming Language Elements for Correctness Proofs. 403-425 - Lorand Muzamel:
Pebble Alternating Tree-Walking Automata and Their Recognizing Power. 427-450 - Dénes Paczolay, András Bánhalmi, András Kocsor:
Robust Clustering - Based Realtime Vowel Recognition. 451-462 - Krisztina Tóth, Richárd Farkas, András Kocsor:
Sentence Alignment of Hungarian-English Parallel Corpora Using a Hybrid Algorithm. 463-478 - Mihály Biczó, Krisztián Pócza, István Forgács, Zoltán Porkoláb:
A New Concept of Effective Regression Test Generation in a C++ Specific Environment. 481-501 - Timo Poranen:
Two New Approximation Algorithms for the Maximum Planar Subgraph Problem. 503-527 - Attila Sali, Klaus-Dieter Schewe:
Keys and Armstrong Databases in Trees with Restructuring. 529-556
Volume 18, Number 4, 2008
- Tibor Gregorics, Bálint Molnár, Edit Sántáné-Tóth, Péter Szeredi, Zoltán Vámossy, László Zsolt Varga:
Symposium of Young Scientists on Intellignet Systems - Preface. 557-560 - Levente Hunyadi:
Prosper: Developing Web Applications Strongly Integrated with Prolog. 561-578 - Barna Kovács:
Improving Content Management - A Semantic Approach. 579-593 - Róbert Pántya, László Zsakó:
Computer-Based Intelligent Educational Program for Teaching Chemistry. 595-613 - Istvan Szita, András Lörincz:
Factored Value Iteration Converges. 615-635 - László A. Jeni, György Flórea, András Lörincz:
InfoMax Bayesian Learning of the Furuta Pendulum. 637-649 - Viktor Gyenes, Ákos Bontovics, András Lörincz:
Factored Temporal Difference Learning in the New Ties Environment. 651-668 - Evgeny Lomonosov, Gábor Renner:
An Evolutionary Algorithm for Surface Modification. 669-680 - Péter Kárász:
Investigating the Behaviour of a Discrete Retrial System. 681-693 - Miklós Bartha, Miklós Krész:
Splitters and Barriers in Open Graphs Having a Perfect Internal Matching. 697-718 - Pedro Baltazar:
M-Solid Varieties of Languages. 719-731 - Mira Balaban, Steffen Jurk:
Effect Preservation in Transaction Processing in Rule Triggering Systems. 733-776 - Csanád Imreh, Masami Ito:
On Monogenic Nondeterministic Automata. 777-782 - Tomás Masopust, Alexander Meduna, Jirí Simácek:
Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. 783-793 - Endre Vármonostory:
Partially Ordered Pattern Algebras. 795-805
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.