- CSB - MetaPress - Google - Bing - Yahoo
 | 2003 | |
|---|---|---|
| j18 |      | 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 | ||
| j17 | | Abraham Bookstein, Vladimir A. Kulyukin, Timo Raita: Generalized Hamming Distance. Inf. Retr. 5(4): 353-375 (2002) |
| 2001 | ||
| j16 | | Abraham Bookstein, Timo Raita: Discovering term occurrence structure in text. JASIST 52(6): 476-486 (2001) |
| c12 | | Abraham Bookstein, Shmuel T. Klein, Timo Raita: Fuzzy Hamming Distance: A New Dissimilarity Measure. CPM 2001: 86-97 |
| 2000 | ||
| j15 | | Abraham Bookstein, Shmuel T. Klein, Timo Raita: Simple Bayesian Model for Bitmap Compression. Inf. Retr. 1(4): 315-328 (2000) |
| c11 | | Lasse Bergroth, Harri Hakonen, Timo Raita: A Survey of Longest Common Subsequence Algorithms. SPIRE 2000: 39-48 |
| 1999 | ||
| j14 | | Harri Hakonen, Timo Raita: A Family of Fast Constant-Space Substring Search Algorithms. Acta Cybern. 14(2): 239-250 (1999) |
| j13 | | Timo Raita: On Guards and Symbol Dependencies in Substring Search. Softw., Pract. Exper. 29(11): 931-941 (1999) |
| 1998 | ||
| j12 | | Abraham Bookstein, Shmuel T. Klein, Timo Raita: Clumping Properties of Content-Bearing Words. JASIS 49(2): 102-114 (1998) |
| c10 |  | Lasse Bergroth, Harri Hakonen, Timo Raita: New Approximation Algorithms for Longest Common Subsequences. SPIRE 1998: 32-40 |
| 1997 | ||
| j11 | | Abraham Bookstein, Shmuel T. Klein, Timo Raita: An overhead reduction technique for mega-state compression schemes. Inf. Process. Manage. 33(6): 745-760 (1997) |
| j10 | | Abraham Bookstein, Shmuel T. Klein, Timo Raita: Modeling Word Occurrences for the Compression of Concordances. ACM Trans. Inf. Syst. 15(3): 254-290 (1997) |
| c9 | | Abraham Bookstein, Shmuel T. Klein, Timo Raita: An Overhead Reduction Technique For Mega-State Compression Schemes. Data Compression Conference 1997: 367-376 |
| 1995 | ||
| c8 | | Abraham Bookstein, Shmuel T. Klein, Timo Raita: Detecting Content-Bearing Words by Serial Clustering. SIGIR 1995: 319-327 |
| 1994 | ||
| j9 | | Jukka Teuhola, Timo Raita: Arithmetic coding into fixed-length codewords. IEEE Transactions on Information Theory 40(1): 219-223 (1994) |
| c7 | | Abraham Bookstein, Shmuel T. Klein, Timo Raita: Markov Models for Clusters in Concordance Compression. Data Compression Conference 1994: 116-125 |
| 1993 | ||
| j8 | | Jukka Teuhola, Timo Raita: Application of a Finite-State Model to Text Compression. Comput. J. 36(7): 607-614 (1993) |
| c6 | | 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 |
| c5 | | |
| 1992 | ||
| j7 | | Olli Nevalainen, Timo Raita: An Internal Hybrid Sort Algorithm Revisited. Comput. J. 35(2): 177-183 (1992) |
| j6 | | Jyrki Katajainen, Timo Raita: An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding. J. ACM 39(2): 281-294 (1992) |
| j5 | | Timo Raita: Tuning the Boyer-Moore-Horspool String Searching Algorithm. Softw., Pract. Exper. 22(10): 879-884 (1992) |
| c4 | | Abraham Bookstein, Shmuel T. Klein, Timo Raita: Model Based Concordance Compression. Data Compression Conference 1992: 82-91 |
| 1991 | ||
| j4 | | Martti Juhola, Jyrki Katajainen, Timo Raita: Comparison of algorithms for standard median filtering. IEEE Transactions on Signal Processing 39(1): 204-208 (1991) |
| c3 | | |
| 1989 | ||
| j3 | | Jyrki Katajainen, Timo Raita: An Approximation Algorithm for Space-Optimal Encoding of a Text. Comput. J. 32(3): 228-237 (1989) |
| j2 | | Timo Raita, Jukka Teuhola: Predictive encoding in text compression. Inf. Process. Manage. 25(2): 151-160 (1989) |
| 1987 | ||
| j1 | | |
| c2 | | |
| 1986 | ||
| c1 | | |
Colors in the list of coauthors
Last update Mon May 20 16:02:58 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page