Shmuel T. Klein
List of publications from the
| 2008 |
|---|
| 67 | EE | Shmuel Tomi Klein,
Miri Kopel Ben-Nissan:
Using Fibonacci Compression Codes as Alternatives to Dense Codes.
DCC 2008: 472-481 |
| 66 | EE | Shmuel Tomi Klein,
Dana Shapira:
Huffman Coding with Non-sorted Frequencies.
DCC 2008: 526 |
| 65 | EE | Shmuel T. Klein:
Processing queries with metrical constraints in XML-based IR systems.
JASIST 59(1): 86-97 (2008) |
| 2007 |
|---|
| 64 | EE | Shmuel Tomi Klein,
Miri Ben-Nissan:
Accelerating Boyer Moore Searches on Binary Texts.
CIAA 2007: 130-143 |
| 63 | EE | Shmuel T. Klein,
Dana Shapira:
Compressed Delta Encoding for LZSS Encoded Files.
DCC 2007: 113-122 |
| 62 | EE | Shmuel T. Klein:
Fast Decoding of Fibonacci Encoded Texts.
DCC 2007: 388 |
| 61 | EE | Shmuel T. Klein,
B. Riva Shalom,
Yair Kaufman:
Searching for a set of correlated patterns.
J. Discrete Algorithms 5(1): 149-161 (2007) |
| 2006 |
|---|
| 60 | EE | Ehud S. Conley,
Shmuel Tomi Klein:
Compression of Multilingual Aligned Texts.
DCC 2006: 442 |
| 59 | EE | Shmuel Tomi Klein,
Tamar C. Serebro,
Dana Shapira:
Modeling Delta Encoding of Compressed Files.
DCC 2006: 457 |
| 58 | EE | Ehud S. Conley,
Shmuel Tomi Klein:
Using alignment for multilingual text compression.
Stringology 2006: 151-161 |
| 57 | EE | Shmuel Tomi Klein,
Tamar C. Serebro,
Dana Shapira:
Modeling delta encoding of compressed files.
Stringology 2006: 162-170 |
| 56 | EE | Miri Ben-Nissan,
Shmuel Tomi Klein:
Working with compressed concordances.
Stringology 2006: 171-181 |
| 55 | EE | Shmuel T. Klein,
Dana Shapira:
Compressed Pattern Matching in Jpeg Images.
Int. J. Found. Comput. Sci. 17(6): 1297-1306 (2006) |
| 2005 |
|---|
| 54 | EE | Eyal Bergman,
Shmuel T. Klein:
Fast Decoding of Prefix Encoded Texts.
DCC 2005: 143-152 |
| 53 | EE | Shmuel Tomi Klein,
Dana Shapira:
Compressed Pattern Matching in JPEG Images.
DCC 2005: 466 |
| 52 | | Shmuel Tomi Klein,
Dana Shapira:
Compressed pattern matching in JPEG images.
Stringology 2005: 125-134 |
| 51 | EE | Shmuel Tomi Klein,
Yair Wiseman:
Parallel Lempel Ziv coding.
Discrete Applied Mathematics 146(2): 180-191 (2005) |
| 50 | EE | Shmuel Tomi Klein,
Dana Shapira:
Pattern matching in Huffman encoded texts.
Inf. Process. Manage. 41(4): 829-841 (2005) |
| 49 | EE | Yair Kaufman,
Shmuel T. Klein:
Semi-lossless text compression.
Int. J. Found. Comput. Sci. 16(6): 1167-1178 (2005) |
| 2004 |
|---|
| 48 | EE | Yair Kaufman,
Shmuel T. Klein:
Semi-Lossless Text Compression.
Data Compression Conference 2004: 544 |
| 47 | EE | Shmuel T. Klein,
B. Riva Shalom:
Searching for a Set of Correlated Patterns.
SPIRE 2004: 68-69 |
| 46 | EE | Yair Kaufman,
Shmuel T. Klein:
Semi-Lossless Text Compression.
Stringology 2004: 114-123 |
| 2003 |
|---|
| 45 | EE | Yair Kaufman,
Shmuel T. Klein:
An Efficient Compression Scheme Supporting Partial Decoding.
DCC 2003: 433 |
| 44 | EE | Shmuel Tomi Klein,
Yair Wiseman:
Parallel Huffman Decoding with Applications to JPEG Files.
Comput. J. 46(5): 487-497 (2003) |
| 2002 |
|---|
| 43 | EE | Shmuel T. Klein,
Dana Shapira:
Searching in Compressed Dictionaries.
DCC 2002: 142- |
| 2001 |
|---|
| 42 | EE | Shmuel Tomi Klein,
Yair Wiseman:
Parallel Lempel Ziv Coding.
CPM 2001: 18-30 |
| 41 | EE | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Fuzzy Hamming Distance: A New Dissimilarity Measure.
CPM 2001: 86-97 |
| 40 | EE | Shmuel T. Klein,
Dana Shapira:
Pattern Matching in Huffman Encoded Texts.
Data Compression Conference 2001: 449-458 |
| 2000 |
|---|
| 39 | EE | Shmuel T. Klein:
Improving Static Compression Schemes by Alphabet Extension.
CPM 2000: 210-221 |
| 38 | EE | Shmuel Tomi Klein,
Yair Wiseman:
Parallel Huffman Decoding.
Data Compression Conference 2000: 383-392 |
| 37 | EE | Shmuel T. Klein,
Dana Shapira:
A New Compression Method for Compressed Matching.
Data Compression Conference 2000: 400-409 |
| 36 | | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Simple Bayesian Model for Bitmap Compression.
Inf. Retr. 1(4): 315-328 (2000) |
| 35 | | Shmuel T. Klein:
Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts.
Inf. Retr. 3(1): 7-23 (2000) |
| 1999 |
|---|
| 34 | | Aviezri S. Fraenkel,
Shmuel T. Klein:
Information Retrieval from Annotated Texts.
JASIS 50(10): 845-854 (1999) |
| 1998 |
|---|
| 33 | | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Clumping Properties of Content-Bearing Words.
JASIS 49(2): 102-114 (1998) |
| 1997 |
|---|
| 32 | | Shmuel T. Klein:
Space- and Time-Efficient Decoding with Canonical Huffman Trees.
CPM 1997: 65-75 |
| 31 | | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
An Overhead Reduction Technique For Mega-State Compression Schemes.
Data Compression Conference 1997: 367-376 |
| 30 | 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) |
| 29 | | Shmuel T. Klein:
Efficient Optimal Recompression.
Comput. J. 40(2/3): 117-126 (1997) |
| 28 | | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
An overhead reduction technique for mega-state compression schemes.
Inf. Process. Manage. 33(6): 745-760 (1997) |
| 1996 |
|---|
| 27 | EE | Aviezri S. Fraenkel,
Shmuel T. Klein:
Robust Universal Complete Codes for Transmission and Compression.
Discrete Applied Mathematics 64(1): 31-55 (1996) |
| 1995 |
|---|
| 26 | | Alistair Moffat,
Justin Zobel,
Shmuel T. Klein:
Improved Inverted File Processing for Large Text Databases.
Australasian Database Conference 1995: 0- |
| 25 | EE | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Detecting Content-Bearing Words by Serial Clustering.
SIGIR 1995: 319-327 |
| 24 | EE | Shmuel T. Klein:
Efficient Recompression Techniques for Dynamic Full-Text Retrieval Systems.
SIGIR 1995: 39-47 |
| 1994 |
|---|
| 23 | | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Markov Models for Clusters in Concordance Compression.
Data Compression Conference 1994: 116-125 |
| 22 | | Aviezri S. Fraenkel,
Shmuel T. Klein:
Complexity Aspects of Guessing Prefix Codes.
Algorithmica 12(4/5): 409-419 (1994) |
| 1993 |
|---|
| 21 | | 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 |
| 20 | EE | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Is Huffman Coding Dead?
SIGIR 1993: 80-87 |
| 19 | | Aviezri S. Fraenkel,
Shmuel T. Klein:
Bounding the Depth of Search Trees.
Comput. J. 36(7): 668-678 (1993) |
| 1992 |
|---|
| 18 | | Abraham Bookstein,
Shmuel T. Klein,
Timo Raita:
Model Based Concordance Compression.
Data Compression Conference 1992: 82-91 |
| 17 | | Abraham Bookstein,
Shmuel T. Klein:
Models of Bitmap Generation: A Systematic Approach to Bitmap Compression.
Inf. Process. Manage. 28(6): 735-748 (1992) |
| 16 | | Abraham Bookstein,
Shmuel T. Klein,
Donald A. Ziff:
A Systematic Approach to Compressing a Full-Text Retrieval System.
Inf. Process. Manage. 28(6): 795- (1992) |
| 1991 |
|---|
| 15 | | Abraham Bookstein,
Shmuel T. Klein:
Flexible Compression for Bitmap Sets.
Data Compression Conference 1991: 402-410 |
| 14 | EE | Abraham Bookstein,
Shmuel T. Klein:
Compression of a Set of Correlated Bitmaps.
SIGIR 1991: 63-71 |
| 13 | | Abraham Bookstein,
Shmuel T. Klein:
Compression of correlated bit-vectors.
Inf. Syst. 16(4): 387-400 (1991) |
| 1990 |
|---|
| 12 | | Abraham Bookstein,
Shmuel T. Klein:
Information Retrieval Tools for Literary Analysis.
DEXA 1990: 1-7 |
| 11 | EE | Abraham Bookstein,
Shmuel T. Klein:
Construction of Optimal Graphs for Bit-Vector Compression.
SIGIR 1990: 327-342 |
| 10 | EE | Abraham Bookstein,
Shmuel T. Klein:
Compression, Information Theory, and Grammars: A Unified Approach.
ACM Trans. Inf. Syst. 8(1): 27-49 (1990) |
| 9 | | Aviezri S. Fraenkel,
Shmuel T. Klein:
Bidirectional Huffman Coding.
Comput. J. 33(4): 296-307 (1990) |
| 8 | EE | Abraham Bookstein,
Shmuel T. Klein:
Using bitmaps for medium sized information retrieval systems.
Inf. Process. Manage. 26(4): 525-533 (1990) |
| 1989 |
|---|
| 7 | EE | Shmuel T. Klein,
Abraham Bookstein,
Scott C. Deerwester:
Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations.
SIGIR 1989: 160-167 |
| 6 | EE | Shmuel T. Klein,
Abraham Bookstein,
Scott C. Deerwester:
Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations.
ACM Trans. Inf. Syst. 7(3): 230-245 (1989) |
| 1988 |
|---|
| 5 | EE | Yaacov Choueka,
Aviezri S. Fraenkel,
Shmuel T. Klein:
Compression of Concordances in Full-Text Retrieval Systems.
SIGIR 1988: 597-612 |
| 4 | EE | Z. Agur,
Aviezri S. Fraenkel,
Shmuel T. Klein:
The number of fixed points of the majority rule.
Discrete Mathematics 70(3): 295-302 (1988) |
| 1987 |
|---|
| 3 | EE | Yaacov Choueka,
Aviezri S. Fraenkel,
Shmuel T. Klein,
E. Segal:
Improved Techniques for Processing Queries in Full-Text Systems.
SIGIR 1987: 306-315 |
| 1986 |
|---|
| 2 | EE | Yaacov Choueka,
Aviezri S. Fraenkel,
Shmuel T. Klein,
E. Segal:
Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems.
SIGIR 1986: 88-96 |
| 1985 |
|---|
| 1 | | Yaacov Choueka,
Shmuel T. Klein,
Yehoshua Perl:
Efficient Variants of Huffman Codes in High Level Languages.
SIGIR 1985: 122-130 |
