Timo Raita

Publication Activity (10 Years)

Years Active: 1986-2003
Publications (10 Years): 0

Publications

Abraham Bookstein, Vladimir A. Kulyukin, Timo Raita, John Nicholson
Adapting measures of clumping strength to assess term-term similarity. J. Assoc. Inf. Sci. Technol. 54 (7) (2003)
Abraham Bookstein, Vladimir A. Kulyukin, Timo Raita
Generalized Hamming Distance. Inf. Retr. 5 (4) (2002)
Abraham Bookstein, Timo Raita
Discovering term occurrence structure in text. J. Assoc. Inf. Sci. Technol. 52 (6) (2001)
Abraham Bookstein, Shmuel T. Klein, Timo Raita
Fuzzy Hamming Distance: A New Dissimilarity Measure. CPM (2001)
Abraham Bookstein, Shmuel T. Klein, Timo Raita
Simple Bayesian Model for Bitmap Compression. Inf. Retr. 1 (4) (2000)
Lasse Bergroth, Harri Hakonen, Timo Raita
A Survey of Longest Common Subsequence Algorithms. SPIRE (2000)
Timo Raita
On Guards and Symbol Dependencies in Substring Search. Softw. Pract. Exp. 29 (11) (1999)
Harri Hakonen, Timo Raita
A Family of Fast Constant-Space Substring Search Algorithms. Acta Cybern. 14 (2) (1999)
Abraham Bookstein, Shmuel T. Klein, Timo Raita
Clumping Properties of Content-Bearing Words. J. Am. Soc. Inf. Sci. 49 (2) (1998)
Lasse Bergroth, Harri Hakonen, Timo Raita
New Approximation Algorithms for Longest Common Subsequences. SPIRE (1998)
Abraham Bookstein, Shmuel T. Klein, Timo Raita
An overhead reduction technique for mega-state compression schemes. Inf. Process. Manag. 33 (6) (1997)
Abraham Bookstein, Shmuel T. Klein, Timo Raita
An Overhead Reduction Technique For Mega-State Compression Schemes. Data Compression Conference (1997)
Abraham Bookstein, Shmuel T. Klein, Timo Raita
Modeling Word Occurrences for the Compression of Concordances. ACM Trans. Inf. Syst. 15 (3) (1997)
Abraham Bookstein, Shmuel T. Klein, Timo Raita
Detecting Content-Bearing Words by Serial Clustering. SIGIR (1995)
Abraham Bookstein, Shmuel T. Klein, Timo Raita
Markov Models for Clusters in Concordance Compression. Data Compression Conference (1994)
Jukka Teuhola, Timo Raita
Arithmetic coding into fixed-length codewords. IEEE Trans. Inf. Theory 40 (1) (1994)
Abraham Bookstein, Shmuel T. Klein, Timo Raita, I. K. Ravichandra Rao, M. D. Patil
Can Random Fluctuation Be Exploited in Data Compression. Data Compression Conference (1993)
Jukka Teuhola, Timo Raita
Application of a Finite-State Model to Text Compression. Comput. J. 36 (7) (1993)
Abraham Bookstein, Shmuel T. Klein, Timo Raita
Is Huffman Coding Dead? SIGIR (1993)
Abraham Bookstein, Shmuel T. Klein, Timo Raita
Model Based Concordance Compression. Data Compression Conference (1992)
Olli Nevalainen, Timo Raita
An Internal Hybrid Sort Algorithm Revisited. Comput. J. 35 (2) (1992)
Jyrki Katajainen, Timo Raita
An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding. J. ACM 39 (2) (1992)
Timo Raita
Tuning the Boyer-Moore-Horspool String Searching Algorithm. Softw. Pract. Exp. 22 (10) (1992)
Jukka Teuhola, Timo Raita
Piecewise Arithmetic Coding. Data Compression Conference (1991)
Martti Juhola, Jyrki Katajainen, Timo Raita
Comparison of algorithms for standard median filtering. IEEE Trans. Signal Process. 39 (1) (1991)
Jyrki Katajainen, Timo Raita
An Approximation Algorithm for Space-Optimal Encoding of a Text. Comput. J. 32 (3) (1989)
Timo Raita, Jukka Teuhola
Predictive encoding in text compression. Inf. Process. Manag. 25 (2) (1989)
Timo Raita
An Automatic System for File Compression. Comput. J. 30 (1) (1987)
Timo Raita, Jukka Teuhola
Predictive Text Compression by Hashing. SIGIR (1987)
Jukka Teuhola, Timo Raita
Text Compression Using Prediction. SIGIR (1986)