Jukka Teuhola

Softw. Pract. Exp., 2020

2019

Automatic detection of cereal rows by means of pattern recognition techniques.

[BibT_eX]

[DOI]

Comput. Electron. Agric., 2019

2015

Classification of plant species from images of overlapping leaves.

[BibT_eX]

[DOI]

Comput. Electron. Agric., 2015

Diversifying SQL to Prevent Injection Attacks.

[BibT_eX]

[DOI]

Sampsa Rauti

Ville Leppänen

Proceedings of the 2015 IEEE TrustCom/BigDataSE/ISPA, 2015

2012

Improved Address-Calculation Coding of Integer Arrays.

[BibT_eX]

[DOI]

Amr Elmasry

Proceedings of the String Processing and Information Retrieval, 2012

2011

Nonblock Coding of Binary Sources by Probabilistic Enumeration.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Interpolative coding of integer sequences supporting log-time random access.

[BibT_eX]

[DOI]

Inf. Process. Manag., 2011

2009

Tournament Coding of Integer Sequences.

[BibT_eX]

[DOI]

Comput. J., 2009

2007

Predictive modeling in XML compression.

[BibT_eX]

[DOI]

Olli Luoma

Proceedings of the Second IEEE International Conference on Digital Information Management (ICDIM), 2007

2006

Complexity Analysis of H.264 Decoder for FPGA Design.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE International Conference on Multimedia and Expo, 2006

Building a UML Profile for On-Chip Distributed Platforms.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual International Computer Software and Applications Conference, 2006

2005

A Probabilistic Approach to Mining Fuzzy Frequent Patterns.

[BibT_eX]

[DOI]

Proceedings of the Classification and Clustering for Knowledge Discovery, 2005

2004

Multidimensional fuzzy partitioning of attribute ranges for mining quantitative data.

[BibT_eX]

[DOI]

Int. J. Intell. Syst., 2004

2003

Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets.

[BibT_eX]

[DOI]

Proceedings of the FIMI '03, 2003

2002

Mining Fuzzy Frequent Patterns Without Repeated Candidate Generation.

[BibT_eX]

Proceedings of the FSDK'02, 2002

2001

A General Approach to Compression of Hierarchical Indexes.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 12th International Conference, 2001

1999

Heaps and Heapsort on Secondary Storage.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Split Algorithms for Sets of High-Dimensional Objects.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 10th International Conference, 1999

1998

Fast Image Compression by Quadtree Prediction.

[BibT_eX]

[DOI]

Real Time Imaging, 1998

1997

Heuristic Clustering of Database Objects According to Multi-Valued Attributes.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 8th International Conference, 1997

1996

Path Signatures: A Way to Speed Up Recursion in Relational Databases.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 1996

Practical In-Place Mergesort.

[BibT_eX]

Tomi Pasanen

Nord. J. Comput., 1996

Deferred Maintenance of Replicated Objects in Single-Site Databases.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Workshop on Database and Expert Systems Applications, 1996

1995

Selection of Object Surrogates to Support Clustering.

[BibT_eX]

[DOI]

Data Knowl. Eng., 1995

Effective Clustering of Objects Stored by Linear Hashing.

[BibT_eX]

[DOI]

Proceedings of the CIKM '95, Proceedings of the 1995 International Conference on Information and Knowledge Management, November 28, 1995

1994

Arithmetic coding into fixed-length codewords.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

An Efficient Relational Implementation of Recursive Relationships using Path Signatures.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Conference on Data Engineering, 1994

1993

Application of a Finite-State Model to Text Compression.

[BibT_eX]

[DOI]

Comput. J., 1993

Clustering of Shared Subobjects in Databases.

[BibT_eX]

Proceedings of the International Conference on Information Systems and Management of Data, 1993

1992

In-place Linear Probing Sort.

[BibT_eX]

[DOI]

Svante Carlsson

Proceedings of the STACS 92, 1992

1991

Minimal Space, Average Linear Time Duplicate Deletion.

[BibT_eX]

[DOI]

Lutz M. Wegner

Commun. ACM, 1991

Piecewise Arithmetic Coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1991

1989

The External Heapsort.

[BibT_eX]

[DOI]

Lutz M. Wegner

IEEE Trans. Software Eng., 1989

Predictive encoding in text compression.

[BibT_eX]

[DOI]

Inf. Process. Manag., 1989

1987

A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood Graphs.

[BibT_eX]

[DOI]

Olli Nevalainen

Inf. Process. Lett., 1987

Predictive Text Compression by Hashing.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1987

Managing Schema Versions in a time-versioned Non-First-Normal-Form Relational Database.

[BibT_eX]

[DOI]

Peter Dadam

Proceedings of the Datenbanksysteme in Büro, 1987

1986

Syntax-directed Compression of Program Files.

[BibT_eX]

[DOI]

Martti Penttonen

Softw. Pract. Exp., 1986

Text Compression Using Prediction.

[BibT_eX]

[DOI]

Proceedings of the SIGIR'86, 1986

1980

A Constructive Approach to Logical Data Base Design.

[BibT_eX]

Matti Jakobsson

Proceedings of the Proceedings International Conference on Data Bases, 1980

1979

Priority Queue Administration by Sublist Index.

[BibT_eX]

[DOI]

Olli Nevalainen

Comput. J., 1979

1978

A Compression Method for Clustered Bit-Vectors.

[BibT_eX]

[DOI]