[ pdf ] cta Cybernetica 17 2006 471 483 On the Complete Axiomatization for Prefix Iteration modulo Observation Congruence Taolue Chen Tingting Han and Jian Lu Abstract Prefix iteration is a variation on the original binary version of the Kleene star operation P Q obtained by restricting the first argument to be an atomic action Aceto and Ing olfsd ottir pr...
.pdf...eged.hu/actacybernetica/edb/vol17n3/pdf/Chen_2006_ActaCybernetica.pdf
[ pdf ] cta Cybernetica 17 2006 617 632 Word Order and Discontinuities in Dependency Grammar C Bartha T Spiegelhauer R Dormeyer and I Fischer Abstract Natural languages are always difficult to parse Two phenomena that constantly pose problems for different formalisms are word order what part of a sentence has to be placed where and discontinuities words th...
.pdf...ed.hu/actacybernetica/edb/vol17n3/pdf/Bartha_2006_ActaCybernetica.pdf
[ pdf | #DBDBDB | ] cta Cybernetica 17 2006 589 603 MedEdit A Computer Assisted Image Processing and Navigation System for Orthopedic Trauma Surgery Kriszti an Oll e Bal azs Erd ohelyi Attila Kuba Csongor Halmai and Endre Varga Abstract The surgery of fractured bones is often a very complex problem That is the reason why it would be beneficial to create a geometric an...
.pdf...eged.hu/actacybernetica/edb/vol17n3/pdf/Olle_2006_ActaCybernetica.pdf
[ pdf ] cta Cybernetica 17 2006 633 646 Named Entity Recognition for Hungarian Using Various Machine Learning Algorithms Rich ard Farkas Gy orgy Szarvas and Andr as Kocsor Abstract In this paper we introduce a statistical Named Entity recognizer NER system for the Hungarian language We examined three methods for identifying and disambiguating proper nouns ...
.pdf...ed.hu/actacybernetica/edb/vol17n3/pdf/Farkas_2006_ActaCybernetica.pdf
[ pdf ] cta Cybernetica 17 2006 449 457 On the closedness of nilpotent DR tree languages under Boolean operations F G ecseg and Gy Gyurica To Professor L aszl o Leindler on his 70th birthday Abstract This note deals with the closedness of nilpotent deterministic root tofrontier tree languages with respect to the Boolean operations union intersection and co...
.pdf...ed.hu/actacybernetica/edb/vol17n3/pdf/Gecseg_2006_ActaCybernetica.pdf
[ pdf ] cta Cybernetica 17 2006 647 659 Learning Tree Patterns for Syntactic Parsing Andr as H ocza Abstract This paper presents a method for parsing Hungarian texts using a machine learning approach The method collects the initial grammar for a learner from an annotated corpus with the help of tree shapes The PGS algorithm an improved version of the RGLea...
.pdf...ged.hu/actacybernetica/edb/vol17n3/pdf/Hocza_2006_ActaCybernetica.pdf
[ pdf ] cta Cybernetica 17 2006 557 587 Image reconstruction and correction methods in neutron and X ray tomography Zolt an Kiss Lajos Rodek and Attila Kuba Abstract Neutron and X ray tomography are imaging techniques for getting information about the interior of objects in a non destructive way They reconstruct cross sections from projection images of the...
.pdf...eged.hu/actacybernetica/edb/vol17n3/pdf/Kiss_2006_ActaCybernetica.pdf
[ pdf ] cta Cybernetica 17 2006 605 614 Sparse Representations Generalized Sparse Approximation and the Equivalent Family of SVM Tasks Zolt an Szab o and Andr as L orincz Abstract Relation between a family of generalized Support Vector Machine SVM problems and the novel sparse representation is provided In defining sparse representations we use a natural g...
.pdf...d.hu/actacybernetica/edb/vol17n3/pdf/Lorincz_2006_ActaCybernetica.pdf
[ pdf ] cta Cybernetica 17 2006 521 531 On Armstrong Relations for Strong Dependencies Vu Duc Thi and Nguyen Hoang Son Abstract The strong dependency has been introduced and axiomatized in 2 3 4 5 The aim of this paper is to investigate on Armstrong relations for strong dependencies We give a necessary and sufficient condition for an abitrary relation to b...
.pdf...zeged.hu/actacybernetica/edb/vol17n3/pdf/Thi_2006_ActaCybernetica.pdf
[ pdf ] cta Cybernetica 17 2006 485 511 Relational Databases and Homogeneity in Logics with Counting Jos e Mar ia Turull Torres Abstract We define a new hierarchy in the class of computable queries to relational databases in terms of the preservation of equality of theories in fragments of first order logic with bounded number of variables with the additio...
.pdf...ed.hu/actacybernetica/edb/vol17n3/pdf/Turull_2006_ActaCybernetica.pdf
