| 2003 |
|---|
| 29 | EE | Abraham Bookstein,
Vladimir A. Kulyukin,
Timo Raita,
John Nicholson:
Adapting measures of clumping strength to assess term-term similarity.
JASIST 54(7): 611-620 (2003) |
| 2002 |
|---|
| 28 | | Abraham Bookstein,
Vladimir A. Kulyukin,
Timo Raita:
Generalized Hamming Distance.
Inf. Retr. 5(4): 353-375 (2002) |
| 2001 |
|---|
| 27 | EE | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Fuzzy Hamming Distance: A New Dissimilarity Measure.
CPM 2001: 86-97 |
| 26 | | Abraham Bookstein,
Timo Raita:
Discovering term occurrence structure in text.
JASIST 52(6): 476-486 (2001) |
| 2000 |
|---|
| 25 | EE | Lasse Bergroth,
Harri Hakonen,
Timo Raita:
A Survey of Longest Common Subsequence Algorithms.
SPIRE 2000: 39-48 |
| 24 | | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Simple Bayesian Model for Bitmap Compression.
Inf. Retr. 1(4): 315-328 (2000) |
| 1999 |
|---|
| 23 | EE | Harri Hakonen,
Timo Raita:
A Family of Fast Constant-Space Substring Search Algorithms.
Acta Cybern. 14(2): 239-250 (1999) |
| 22 | | Timo Raita:
On Guards and Symbol Dependencies in Substring Search.
Softw., Pract. Exper. 29(11): 931-941 (1999) |
| 1998 |
|---|
| 21 | | Lasse Bergroth,
Harri Hakonen,
Timo Raita:
New Approximation Algorithms for Longest Common Subsequences.
SPIRE 1998: 32-40 |
| 20 | | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Clumping Properties of Content-Bearing Words.
JASIS 49(2): 102-114 (1998) |
| 1997 |
|---|
| 19 | | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
An Overhead Reduction Technique For Mega-State Compression Schemes.
Data Compression Conference 1997: 367-376 |
| 18 | EE | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Modeling Word Occurrences for the Compression of Concordances.
ACM Trans. Inf. Syst. 15(3): 254-290 (1997) |
| 17 | | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
An overhead reduction technique for mega-state compression schemes.
Inf. Process. Manage. 33(6): 745-760 (1997) |
| 1995 |
|---|
| 16 | EE | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Detecting Content-Bearing Words by Serial Clustering.
SIGIR 1995: 319-327 |
| 1994 |
|---|
| 15 | | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Markov Models for Clusters in Concordance Compression.
Data Compression Conference 1994: 116-125 |
| 14 | | Jukka Teuhola,
Timo Raita:
Arithmetic coding into fixed-length codewords.
IEEE Transactions on Information Theory 40(1): 219- (1994) |
| 1993 |
|---|
| 13 | | 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: 70-78 |
| 12 | EE | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Is Huffman Coding Dead?
SIGIR 1993: 80-87 |
| 11 | | Jukka Teuhola,
Timo Raita:
Application of a Finite-State Model to Text Compression.
Comput. J. 36(7): 607-614 (1993) |
| 1992 |
|---|
| 10 | | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Model Based Concordance Compression.
Data Compression Conference 1992: 82-91 |
| 9 | | Olli Nevalainen,
Timo Raita:
An Internal Hybrid Sort Algorithm Revisited.
Comput. J. 35(2): 177-183 (1992) |
| 8 | EE | Jyrki Katajainen,
Timo Raita:
An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding.
J. ACM 39(2): 281-294 (1992) |
| 7 | | Timo Raita:
Tuning the Boyer-Moore-Horspool String Searching Algorithm.
Softw., Pract. Exper. 22(10): 879-884 (1992) |
| 1991 |
|---|
| 6 | | Jukka Teuhola,
Timo Raita:
Piecewise Arithmetic Coding.
Data Compression Conference 1991: 33-42 |
| 1989 |
|---|
| 5 | | Jyrki Katajainen,
Timo Raita:
An Approximation Algorithm for Space-Optimal Encoding of a Text.
Comput. J. 32(3): 228-237 (1989) |
| 4 | EE | Timo Raita,
Jukka Teuhola:
Predictive encoding in text compression.
Inf. Process. Manage. 25(2): 151-160 (1989) |
| 1987 |
|---|
| 3 | EE | Timo Raita,
Jukka Teuhola:
Predictive Text Compression by Hashing.
SIGIR 1987: 223-233 |
| 2 | | Timo Raita:
An Automatic System for File Compression.
Comput. J. 30(1): 80-86 (1987) |
| 1986 |
|---|
| 1 | EE | Jukka Teuhola,
Timo Raita:
Text Compression Using Prediction.
SIGIR 1986: 97-102 |
