Publications
Found 76 results
Author Keyword [ Title] Type Year Filters: First Letter Of Last Name is B [Clear All Filters]
Dynamic Computation of Generalised Median Strings. Pattern Anal. Appl.. 6:185–193.
.
2003. Edit distance of run-length coded strings. SAC. :137–143.
.
1992. Efficient algorithm to compute Markov transitional probabilities for a desired PageRank. EPJ Data Science. 9:23.
.
2020. An Efficient Relevant Slicing Method for Debugging. Software Engineering –- ESEC/FSE '99. :303–321.
.
1999. Feature Analysis using Information Retrieval, Community Detection and Structural Analysis Methods in Product Line Adoption. Journal of Systems and Software. 155:70-90.
.
2019. Feature Level Complexity and Coupling Analysis in 4GL Systems. Proceedings of the 18th International Conference on Computational Science and Its Applications (ICCSA 2018).
.
2018. Full Matching and Isomorphism of Nucleotide Chains. INDIAN JOURNAL of PURE AND APPLIED MATHEMATICS. 31:243-263.
.
2000. A Fully Three-Dimensional Method for Facial Reconstruction Based on Deformable Models. Journal of Forensic Sciences. 42:649-652.
.
1997. Graphs with no induced C4 and 2K2. Discrete Mathematics. 115:51–55.
.
1993. 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.
.
2001. 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.
.
1998. Identifying Wasted Effort in the Field via Developer Interaction Data. Software Maintenance and Evolution (ICSME), 2015 IEEE International Conference on. :391-400.
.
2015. Identifying Wasted Effort in the Field via Developer Interaction Data. Software Maintenance and Evolution (ICSME), 2015 IEEE International Conference on. :391-400.
.
2015. An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings. Inf. Process. Lett.. 54:93–96.
.
1995. Inequality-Based Approximation of Matrix Eigenvectors. International Journal of Applied Mathematics and Computer Science. 12:533-538.
.
2002. Manually Annotated Hungarian Corpus. Proceedings of the Tenth Conference on European Chapter of the Association for Computational Linguistics - Volume 2. :53–56.
.
2003. Massively Multilingual Sparse Word Representations. Eighth International Conference on Learning Representations - ICLR 2020. . :1-16.
.
2020. MEDIAN STRINGS: A REVIEW. Data Mining in Time Series Databases. :173-192.
.
2004. On a Merging Reduction of the Process Network Synthesis Problem. Acta Cybern.. 14:251–261.
.
1999. Mining Design Patterns from C++ Source Code. Proceedings of the International Conference on Software Maintenance.
.
2003. A New Interactive Fault Localization Method with Context Aware User Feedback. 2019 IEEE 1ST INTERNATIONAL WORKSHOP ON INTELLIGENT BUG FIXING (IBF `19). :23-28.
.
2019. A Note on Connection Between PNS and Set Covering Problems. Acta Cybern.. 12:309–312.
.
1996. Opening Up The C/C++ Preprocessor Black Box. Proceedings of the Eight Symposium on Programming Languages and Software Tools (SPLST’03). :45-57.
.
2003. On the Optimal Parameters of a Sinusoidal Representation of Signals. Conference of PhD students on Computer Sciences, Volume of Extended Abstracts. :61-63.
.
1998. 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.
.
2001.