Publications

Found 76 results
Author Keyword [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is B  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
G
Blázsik Z, Hujter M, Pluhár A, Tuza Z..  1993.  Graphs with no induced C4 and 2K2. Discrete Mathematics. 115:51–55.
H
Blázsik Z, Keserű K, Kovács Z.  2001.  Heuristics for Simplified Process Network Synthesis (PNS) Problems with a Blossom-Type Algorithm for the Edge Covering Problem. Optimization Theory: Recent Developments from Mátraháza. :19–31.
Kocsor A, Dombi J, Bálint I.  1998.  How to solve matrix-eigenvalue problems by optimizations of various functional inequalities? IMACS/GAMM International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN-98), Volume of extended abstract.
I
Balogh G, Antal G, Beszédes Á, Vidács L, Gyimóthy T, Végh ÁZoltán.  2015.  Identifying Wasted Effort in the Field via Developer Interaction Data. Software Maintenance and Evolution (ICSME), 2015 IEEE International Conference on. :391-400.
Balogh G, Antal G, Beszédes Á, Vidács L, Gyimóthy T, Végh ÁZoltán.  2015.  Identifying Wasted Effort in the Field via Developer Interaction Data. Software Maintenance and Evolution (ICSME), 2015 IEEE International Conference on. :391-400.
Bunke H, Csirik J.  1995.  An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings. Inf. Process. Lett.. 54:93–96.
Kocsor A, Dombi J, Bálint I.  2002.  Inequality-Based Approximation of Matrix Eigenvectors. International Journal of Applied Mathematics and Computer Science. 12:533-538.
M
Alexin Z, Gyimóthy T, Hatvani C, Tihanyi L, Csirik J, Bibok K, Prószéky G.  2003.  Manually Annotated Hungarian Corpus. Proceedings of the Tenth Conference on European Chapter of the Association for Computational Linguistics - Volume 2. :53–56.
Berend G.  2020.  Massively Multilingual Sparse Word Representations. Eighth International Conference on Learning Representations - ICLR 2020. . :1-16.
Jiang X, Bunke H, Csirik J.  2004.  MEDIAN STRINGS: A REVIEW. Data Mining in Time Series Databases. :173-192.
Holló C., Blázsik Z., Imreh C., Kovács Z..  1999.  On a Merging Reduction of the Process Network Synthesis Problem. Acta Cybern.. 14:251–261.
Balanyi Z, Ferenc R.  2003.  Mining Design Patterns from C++ Source Code. Proceedings of the International Conference on Software Maintenance.
N
Horvath F, Lacerda VSchnepper, Beszedes A, Vidacs L, Gyimothy T.  2019.  A New Interactive Fault Localization Method with Context Aware User Feedback. 2019 IEEE 1ST INTERNATIONAL WORKSHOP ON INTELLIGENT BUG FIXING (IBF `19). :23-28.
Blázsik Z, Imreh B.  1996.  A Note on Connection Between PNS and Set Covering Problems. Acta Cybern.. 12:309–312.
O
Vidács L, Beszédes Á.  2003.  Opening Up The C/C++ Preprocessor Black Box. Proceedings of the Eight Symposium on Programming Languages and Software Tools (SPLST’03). :45-57.
Kocsor A, Tóth L, Bálint I.  1998.  On the Optimal Parameters of a Sinusoidal Representation of Signals. Conference of PhD students on Computer Sciences, Volume of Extended Abstracts. :61-63.
Kocsor A, Dombi J, Bálint I.  2001.  An Optimization Based Algorithm for Determining Eigenpairs of Large Real Matrices. ANNALES UNIVERSITATIS SCIENTIARUM BUDAPESTINENSIS DE ROLANDO EÖTVÖS NOMINATAE SECTIO COMPUTATORICA. 20:237-253.

Pages