Timo Raita

Affiliations:
  • University of Turku, Finland


According to our database1, Timo Raita authored at least 29 papers between 1986 and 2003.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2003
Adapting measures of clumping strength to assess term-term similarity.
J. Assoc. Inf. Sci. Technol., 2003

2002
Generalized Hamming Distance.
Inf. Retr., 2002

2001
Discovering term occurrence structure in text.
J. Assoc. Inf. Sci. Technol., 2001

Fuzzy Hamming Distance: A New Dissimilarity Measure.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000
Simple Bayesian Model for Bitmap Compression.
Inf. Retr., 2000

A Survey of Longest Common Subsequence Algorithms.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

1999
On Guards and Symbol Dependencies in Substring Search.
Softw. Pract. Exp., 1999

A Family of Fast Constant-Space Substring Search Algorithms.
Acta Cybern., 1999

1998
Clumping Properties of Content-Bearing Words.
J. Am. Soc. Inf. Sci., 1998

New Approximation Algorithms for Longest Common Subsequences.
Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998

1997
Modeling Word Occurrences for the Compression of Concordances.
ACM Trans. Inf. Syst., 1997

An overhead reduction technique for mega-state compression schemes.
Inf. Process. Manag., 1997

1995
Detecting Content-Bearing Words by Serial Clustering.
Proceedings of the SIGIR'95, 1995

1994
Arithmetic coding into fixed-length codewords.
IEEE Trans. Inf. Theory, 1994

Markov Models for Clusters in Concordance Compression.
Proceedings of the IEEE Data Compression Conference, 1994

1993
Application of a Finite-State Model to Text Compression.
Comput. J., 1993

Is Huffman Coding Dead?
Proceedings of the 16th Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval. Pittsburgh, PA, USA, June 27, 1993

Can Random Fluctuation Be Exploited in Data Compression.
Proceedings of the IEEE Data Compression Conference, 1993

1992
Tuning the Boyer-Moore-Horspool String Searching Algorithm.
Softw. Pract. Exp., 1992

An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding.
J. ACM, 1992

An Internal Hybrid Sort Algorithm Revisited.
Comput. J., 1992

Model Based Concordance Compression.
Proceedings of the IEEE Data Compression Conference, 1992

1991
Comparison of algorithms for standard median filtering.
IEEE Trans. Signal Process., 1991

Piecewise Arithmetic Coding.
Proceedings of the IEEE Data Compression Conference, 1991

1989
Predictive encoding in text compression.
Inf. Process. Manag., 1989

An Approximation Algorithm for Space-Optimal Encoding of a Text.
Comput. J., 1989

1987
An Automatic System for File Compression.
Comput. J., 1987

Predictive Text Compression by Hashing.
Proceedings of the Tenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1987

1986
Text Compression Using Prediction.
Proceedings of the SIGIR'86, 1986


  Loading...