We consider the worst-case query complexity of some variants of certain PPAD-complete search problems. Suppose we are given a graph G and a vertex s ∈ V (G). We denote the directed graph obtained from G by directing all edges in both directions by G′. D is a directed subgraph of G′ which is unknown to us, except that it consists of vertex-disjoint directed paths and cycles and one of the paths ...

Semmelweis University, Department of Psychiatry and Psychotherapy and MTA-SE Neuropsychopharmacology and Neurochemistry Research Group of the Hungarian Academy of Sciences, Budapest, Hungary Semmelweis University, Department of Pharmacodynamics and MTA-SE Neuropsychopharmacology and Neurochemistry Research Group of the Hungarian Academy of Sciences, Budapest, Hungary University of Manchester, N...

In this paper we analyze data collected from three of the biggest Hungarian bittorrent based filesharing communities between 2008 May-June, and Hungarian cinema distribution data from the same period. We asked if the number of downloads for any given film correlates with ticket sales, revenues, the number of cinemas where the film was shown or any other statistical data on the traditional movie...

1 Department of Measurement and Information Systems, Budapest University of Technology and Economics, 1117 Budapest, Magyar tudósok körútja 2. 2 Neurobionics Research Group, Hungarian Academy of Sciences – Péter Pázmány Catholic University – Semmelweis University, H-1094 Budapest, Tőzoltó u. 58., Hungary 3 Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Reáltanoda u. 13-15...

To create the first Hungarian WSD corpus, 39 suitable word form samples were selected for the purpose of word sense disambiguation. Among others, selection criteria required the given word form to be frequent in Hungarian language usage (frequency rates available in the Hungarian National Corpus (HNC) were used for measurement (Váradi, 2000)), and to have more than one sense considered frequent...

1 Computer and Automation Research Institute Hungarian Academy of Sciences Kende u. 13-17, 1111 Budapest, Hungary, and Eötvös Loránd University, Faculty of Informatics Department of Algorithms and Their Applications Pázmány Péter sétány 1/c, 1117 Budapest, Hungary [email protected] 2 Laboratoire d’Algorithmique, Complexité et Logique Département Informatique, Université Paris Est 61, av. Général...

1 Institute of Computer Science, Silesian University in Opava Bezručovo nám. 13, 74601 Opava, Czech Republic {ludek.cienciala,lucie.ciencialova}@fpf.slu.cz 2 Computer and Automation Research Institute Hungarian Academy of Sciences Kende utca 13-17, 1111 Budapest, Hungary {csuhaj,vaszil}@sztaki.hu 3 Department of Algorithms and Their Applications Faculty of Informatics, Eötvös Loránd University ...

1 Institute of Computer Science Faculty of Philosophy and Science Silesian University in Opava Bezručovo nám. 13, 74601 Opava, Czech Republic {lucie.ciencialova, alica.kelemenova}@fpf.slu.cz 2 Computer and Automation Research Institute Hungarian Academy of Sciences Kende utca 13-17, 1111 Budapest, Hungary {csuhaj, vaszil}@sztaki.hu 3 Department of Algorithms and Their Applications Faculty of In...

Key members: Péter Balázs [1] Antal Nagy [2] László Varga [3] László G. Nyúl [4] Founded by: PhD Scholarship of the Doctoral School in Informatics of the University of Szeged [5] János Bolyai Research Scholarship of the Hungarian Academy of Sciences [6] TÁMOP-4.2.1/B-09/1/KONV-2010-0005 program of the Hungarian National Development Agency [7] OTKA PD100950 grant of the Hungarian Scientific Rese...

During the development of the Hungarian WordNet we found that the primarily hierarchical structure of the Princeton WordNet (PWN) had to be expanded in order that it could be used for a more accurate representation of relations among verbal meanings in Hungarian, as well. Treating verbs as eventualities we made some aspectual information explicitly available in the representation of verbs. Usin...