Publications

Found 271 results
Author Keyword Title [ Type(Desc)] Year
Journal Article
Maass W, Turán G.  1994.  Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts. Machine Learning. 14:251–269.
Gergely T, Balogh G, Horváth F, Vancsics B, Beszédes Á, Gyimóthy T.  2018.  Analysis of Static and Dynamic Test-to-code Traceability Information. Acta Cybernetica. 23:903-919.
Kókai G., Alexin Z., Gyimóthy T.  1996.  Analyzing and Learning ECG Waveforms. The Sixth International Workshop on Inductive Logic Programming ILP96. 312292:127–145.
Szepesvári C, Lörincz A.  1996.  Approximate geometry representations and sensory fusion. Neurocomputing. 12:267–287.
Szepesvári C, Lörincz A.  1993.  Behavior of an Adaptive Self-organizing Autonomous Agent Working with Cues and Competing Concepts. Adaptive Behaviour. 2:131–160.
Csirik J, Johnson DS.  2001.  Bounded Space On-Line Bin Packing: Best Is Better than First. Algorithmica. 31:115–138.
Horváth F, Gergely T, Beszédes Á, Tengeri D, Balogh G, Gyimóthy T.  2017.  Code Coverage Differences of Java Bytecode and Source Code Instrumentation Tools. Software Quality Journal.
Vidács L, Beszédes Á, Gyimóthy T.  2009.  Combining preprocessor slicing with C/C++ language slicing. Science of Computer Programming. 74:399-413.
Faigle U, Schrader R, Turán G.  1992.  The Communication Complexity of Interval Orders. Discrete Applied Mathematics. 40:19–28.
Kocsor A, Tóth L, Kuba, Jr. A, Kovács K, Jelasity M, Gyimóthy T, Csirik J.  2000.  A Comparative Study of Several Feature Space Transformation and Learning Methods for Phoneme Classification. International Journal of Speech Technology. 2:263-276.
Turán G.  1995.  On the Complexity of Planar Boolean Circuits. Computational Complexity. 5:24–42.
Turán G, Vatan F.  1997.  On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In. J. Comput. Syst. Sci.. 54:199–212.
Faragó C, Hegedüs P, Végh ÁZoltán, Ferenc R.  2014.  Connection Between Version Control Operations and Quality Change of the Source Code. {Acta Cybernetica}. 21:585–607.
Szilágyi G., Harmath L., Gyimóthy T..  2001.  The Debug slicing of logic programs. Acta Cybernetica. 15:257–278.
Blázsik Z., Holló C., Imreh B..  1998.  On Decision-mappings Related to Process Network Synthesis Problem. Acta Cybern.. 13:319–328.
Gosztolya G, Tóth L.  2017.  DNN-based Feature Extraction for Conflict Intensity Estimation from Speech. IEEE Signal Processing Letters. 24:1837–1841.
Jiang X., Abegglen K., Bunke H., Csirik J.  2003.  Dynamic computation of generalised median strings. Pattern Analysis & Applications. 6:185–193.
Jiang X., Abegglen K., Bunke H., Csirik J.  2003.  Dynamic Computation of Generalised Median Strings. Pattern Anal. Appl.. 6:185–193.
Hegedüs P, Kádár I, Ferenc R, Gyimóthy T.  2018.  Empirical evaluation of software maintainability based on a manually validated refactoring dataset. Information and Software Technology. 95:313-327.
Gábor S, Gábor A, Nagy C, Ferenc R, Gyimóthy T.  2017.  Empirical Study on Refactoring Large-scale Industrial Systems and Its Effects on Maintainability. Journal of Systems and Software. 129:107–126.
Csirik J, Kellerer H, Woeginger GJ.  1992.  The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett.. 11:281–287.
Kicsi A, Csuvik V, Vidács L, Horváth F, Beszédes Á, Gyimóthy T, Kocsis F.  2019.  Feature Analysis using Information Retrieval, Community Detection and Structural Analysis Methods in Product Line Adoption. Journal of Systems and Software. 155:70-90.
Gosztolya G, Tóth L.  2018.  A feature selection-based speaker clustering method for paralinguistic tasks. Pattern Analysis and Applications. 21:193–204.
Sloan RH, Takata K, Turán G.  1998.  On Frequent Sets of Boolean Matrices. Ann. Math. Artif. Intell.. 24:193–209.
Quatrehomme G, Cotin S, Subsol G, Delingette H, Garidel Y, Grévin G, Fidrich M, Bailet P, Ollier A.  1997.  A Fully Three-Dimensional Method for Facial Reconstruction Based on Deformable Models. Journal of Forensic Sciences. 42:649-652.

Pages