Timo Raita

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