János Csirik

According to our database1, János Csirik
  • authored at least 66 papers between 1986 and 2014.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2014
Szeged Corpus 2.5: Morphological Modifications in a Manually POS-tagged Hungarian Corpus.
Proceedings of the Ninth International Conference on Language Resources and Evaluation, 2014

2013
Online Clustering with Variable Sized Clusters.
Algorithmica, 2013

Computing Semantic Similarity Using Large Static Corpora.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

2012
A Manually Annotated Corpus of Pharmaceutical Patents.
Proceedings of the Text, Speech and Dialogue - 15th International Conference, 2012

2011
On Positive and Unlabeled Learning for Text Classification.
Proceedings of the Text, Speech and Dialogue - 14th International Conference, 2011

Sequential Classifier Combination for Pattern Recognition in Wireless Sensor Networks.
Proceedings of the Multiple Classifier Systems - 10th International Workshop, 2011

The Effect of Training Data Selection and Sampling Time Intervals on Signature Verification.
Proceedings of the 1st International Workshop on Automated Forensic Handwriting Analysis: A Satellite Workshop of ICDAR-2011, 2011

Online Signature Verification Method Based on the Acceleration Signals of Handwriting Samples.
Proceedings of the Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2011

2010
On the sum minimization version of the online bin covering problem.
Discrete Applied Mathematics, 2010

Online Clustering with Variable Sized Clusters.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Hungarian Dependency Treebank.
Proceedings of the International Conference on Language Resources and Evaluation, 2010

The CoNLL-2010 Shared Task: Learning to Detect Hedges and their Scope in Natural Language Text.
Proceedings of the Fourteenth Conference on Computational Natural Language Learning: Shared Task, 2010

Hungarian Corpus of Light Verb Constructions.
Proceedings of the COLING 2010, 2010

2008
Random-order bin packing.
Discrete Applied Mathematics, 2008

The BioScope corpus: biomedical texts annotated for uncertainty, negation and their scopes.
BMC Bioinformatics, 2008

Hungarian Word-Sense Disambiguated Corpus.
Proceedings of the International Conference on Language Resources and Evaluation, 2008

2007
Variable-Sized Bin Packing and Bin Covering.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Variants of Classical One-Dimensional Bin Packing.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Performance Guarantees for One-Dimensional Bin Packing.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

A Classification Scheme for Bin Packing Theory.
Acta Cybern., 2007

2006
On the Sum-of-Squares algorithm for bin packing.
J. ACM, 2006

A highly accurate Named Entity corpus for Hungarian.
Proceedings of the Fifth International Conference on Language Resources and Evaluation, 2006

2005
On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing
CoRR, 2005

The Szeged Treebank.
Proceedings of the Text, Speech and Dialogue, 8th International Conference, 2005

2004
POS Tagging of Hungarian with Combined Statistical and Rule-Based Methods.
Proceedings of the Text, Speech and Dialogue, 7th International Conference, 2004

The Szeged Corpus: A POS Tagged and Syntactically Annotated Hungarian Natural Language Corpus.
Proceedings of the Text, Speech and Dialogue, 7th International Conference, 2004

2003
Dynamic computation of generalised median strings.
Pattern Anal. Appl., 2003

Annotated Hungarian National Corpus.
Proceedings of the EACL 2003, 2003

2002
Resource augmentation for online bounded space bin packing.
J. Algorithms, 2002

On the Sum-of-Squares Algorithm for Bin Packing
CoRR, 2002

Union Slices for Program Maintenance.
Proceedings of the 18th International Conference on Software Maintenance (ICSM 2002), 2002

2001
Bounded Space On-Line Bin Packing: Best Is Better than First.
Algorithmica, 2001

Fast Independent Component Analysis in Kernel Feature Spaces.
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

Better approximation algorithms for bin covering.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Buying a Constant Competitive Ratio for Paging.
Proceedings of the Algorithms, 2001

Dynamic Slicing Method for Maintenance of Large C Programs.
Proceedings of the Fifth Conference on Software Maintenance and Reengineering, 2001

2000
A Comparative Study of Several Feature Transformation and Learning Methods for Phoneme Classification.
I. J. Speech Technology, 2000

On the sum-of-squares algorithm for bin packing.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Resource Augmentation for Online Bounded Space Bin Packing.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Two Simple Algorithms for bin Covering.
Acta Cybern., 1999

A Self Organizing Bin Packing Heuristic.
Proceedings of the Algorithm Engineering and Experimentation, 1999

1998
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.
Algorithmica, 1998

1997
Shelf Algorithms for On-Line Strip Packing.
Inf. Process. Lett., 1997

Learning Phonetic Rules in a Speech Recognition System.
Proceedings of the Inductive Logic Programming, 7th International Workshop, 1997

Learning the Syntax and Semantic Rules of an ECG Grammar.
Proceedings of the AI*IA 97: Advances in Artificial Intelligence, 1997

1996
On-line and Off-line Approximation Algorithms for Vector Covering Problems.
Proceedings of the Algorithms, 1996

On-line Packing and Covering Problems.
Proceedings of the Online Algorithms, 1996

1995
Parametric string edit distance and its application to pattern recognition.
IEEE Trans. Systems, Man, and Cybernetics, 1995

An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings.
Inf. Process. Lett., 1995

1993
The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm.
J. Algorithms, 1993

Two-Dimensional Rectangle Packing: On-Line Methods and Results.
Discrete Applied Mathematics, 1993

An algorithm for matching run-length coded strings.
Computing, 1993

1992
Edit distance of run-length coded strings.
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, 1992

1991
Probabilistic Analysis of Algorithms for Dual Bin Packing Problems.
J. Algorithms, 1991

Heuristic for the 0-1 Min-Knapsack Problem.
Acta Cybern., 1991

Bounded Space On-Line Bin Packing: Best is Better than First.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990
On the multidimensional vector bin packing.
Acta Cybern., 1990

1989
On the worst-case performance of the NkF bin-packing heuristic.
Acta Cybern., 1989

An On-Line Algorithm for Variable-Sized Bin Packing.
Acta Inf., 1989

1988
Online algorithms for a dual version of bin packing.
Discrete Applied Mathematics, 1988

Longest k-distance substrings of two strings.
Proceedings of the 9th International Conference on Pattern Recognition, 1988

1987
A computer algorithm to determine the recognition site of restriction enzymes.
Computer Applications in the Biosciences, 1987

On the expected behaviour of the NF algorithm for a dual bin-packing problem.
Acta Cybern., 1987

1986
An O(n) bin-packing algorithm for uniformly distributed data.
Computing, 1986

The probabilistic behaviour of the NFD Bin Packing algorithm.
Acta Cybern., 1986


  Loading...