| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Alistair Moffat 79 Vo Ngoc Anh , Alistair Moffat: Improved Retrieval Effectiveness Through Impact Transformation. Australasian Database Conference 2002 78 Raymond Wan , Alistair Moffat: Block Merging for Off-Line Compression. CPM 2002 : 32-41 77 M. Liddell , Alistair Moffat: Length-Restricted Coding in Static and Dynamic Frameworks. Data Compression Conference 2001 : 133-142 76 Anthony Ian Wirth , Alistair Moffat: Can We Do without Ranks in Burrows Wheeler Transform Compression? Data Compression Conference 2001 : 419-428 75 R. Y. K. Isal , Alistair Moffat: Parsing Strategies for BWT Compression. Data Compression Conference 2001 : 429-438 74 Ahn Ngoc Vo , Owen de Kretser , Alistair Moffat: Vector-Space Ranking with Effective Early Termination. SIGIR 2001 : 35-42 73 Raymond Wan , Alistair Moffat: Interactive Phrase Browsing Within Compressed Text. SIGIR 2001 : 410-411 72 Alistair Moffat, Raymond Wan : Re-Store: A System for Compressing, Browsing, and Searching Large Documents (Invited Paper). SPIRE 2001 : 162-174 71 Alistair Moffat, Lang Stuiver : Binary Interpolative Coding for Effective Index Compression. Information Retrieval 3 (1): 25-47 (2000) 70 Ian H. Witten , Alistair Moffat, Timothy C. Bell : Managing Gigabytes: Compressing and Indexing Documents and Images, Second Edition. Morgan Kaufmann 1999 69 Owen de Kretser , Alistair Moffat: Locality-Based Information Retrieval. Australasian Database Conference 1999 : 177-188 68 N. Jesper Larsson , Alistair Moffat: Offline Dictionary-Based Compression. Data Compression Conference 1999 : 296-305 67 Owen de Kretser , Alistair Moffat: Effective Document Presentation with a Locality-Based Similarity Heuristic. SIGIR 1999 : 113-120 66 Andrew Turpin , Alistair Moffat: Statistical Phrases for Vector-Space Information Retrieval (poster abstract). SIGIR 1999 : 309-310 65 Alistair Moffat: An Improved Data Structure for Cumulative Probability Tables. Software - Practice and Experience 29 (7): 647-659 (1999) 64 Lang Stuiver , Alistair Moffat: Piecewise Integer Mapping for Arithmetic Coding. Data Compression Conference 1998 : 3-12 63 Owen de Kretser , Alistair Moffat, Tim Shimmin , Justin Zobel : Methodologies for Distributed Information Retrieval. ICDCS 1998 : 66-73 62 Anh Ngoc Vo , Alistair Moffat: Compressed Inverted Files with Reduced Decoding Overheads. SIGIR 1998 : 290-297 61 Owen de Kretser , Alistair Moffat, Justin Zobel : Teraphim : An Engine for Distributed Information Retrieval. SIGIR 1998 : 384 60 Alistair Moffat, Ola Petersson , Nicholas C. Wormald : A Tree-Based Mergesort. Acta Informatica 35 (9): 775-793 (1998) 59 Andrew Turpin , Alistair Moffat: Comment on ``Efficient Huffman Decoding'' and ``An Efficient Finite-State Machine Implementation of Huffman Decoders''. Information Processing Letters 68 (1): 1-2 (1998) 58 Justin Zobel , Alistair Moffat: Exploring the Similarity Space. SIGIR Forum 32 (1): 18-34 (1998) 57 Justin Zobel , Alistair Moffat, Kotagiri Ramamohanarao : Inverted Files Versus Signature Files for Text Indexing. TODS 23 (4): 453-490 (1998) 56 Alistair Moffat, Radford M. Neal , Ian H. Witten : Arithmetic Coding Revisited. TOIS 16 (3): 256-294 (1998) 55 Andrew Turpin , Alistair Moffat: Efficient Approximate Adaptive Coding. Data Compression Conference 1997 : 357-366 54 Alistair Moffat, Justin Zobel , Neil Sharman : Text Compression for Dynamic Document Databases. TKDE 9 (2): 302-313 (1997) 53 Alistair Moffat, Andrew Turpin : On the Implementation of Minimum-Redundancy Prefix Codes. Data Compression Conference 1996 : 170-179 52 Alistair Moffat, Lang Stuiver : Exploiting Clustering in Inverted File Compression. Data Compression Conference 1996 : 82-91 51 Timothy A. H. Bell , Alistair Moffat: The Design of a High Performance Information Filtering System. SIGIR 1996 : 12-20 50 Justin Zobel , Alistair Moffat, Kotagiri Ramamohanarao : Guidelines for Presentation and Comparison of Indexing Techniques. SIGMOD Record 25 (3): 10-15 (1996) 49 Alistair Moffat, Gary Eddy , Ola Petersson : Splaysort: Fast, Versatile, Practical. Software - Practice and Experience 26 (7): 781-797 (1996) 48 Alistair Moffat, Justin Zobel : Self-Indexing Inverted Files for Fast Text Retrieval. TOIS 14 (4): 349-379 (1996) 47 John Staples , Peter Eades , Naoki Katoh , Alistair Moffat: Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings. Springer 1995 46 Alistair Moffat, Justin Zobel , Shmuel T. Klein : Improved Inverted File Processing for Large Text Databases. Australasian Database Conference 1995 : 0- 45 Alistair Moffat, Andrew Turpin , Jyrki Katajainen : Space-Efficient Construction of Optimal Prefix Codes. Data Compression Conference 1995 : 192-201 44 Alistair Moffat, Radford M. Neal , Ian H. Witten : Arithmetic Coding Revisited. Data Compression Conference 1995 : 202-211 43 Jyrki Katajainen , Alistair Moffat, Andrew Turpin : A Fast and Space - Economical Algorithm for Length - Limited Coding. ISAAC 1995 : 12-21 42 Alistair Moffat, Jyrki Katajainen : In-Place Calculation of Minimum-Redundancy Codes. WADS 1995 : 393-402 41 Alistair Moffat, Justin Zobel : Index Organization for Multimedia Database Systems. ACM Computing Surveys 27 (4): 607-609 (1995) 40 Timothy C. Bell , Alistair Moffat, Ian H. Witten , Justin Zobel : The MG Retrieval System: Compressing for Space and Speed. CACM 38 (4): 41-42 (1995) 39 Justin Zobel , Alistair Moffat, Ross Wilkinson , Ron Sacks-Davis : Efficient Retrieval of Partial Documents. Information Processing and Management 31 (3): 361-377 (1995) 38 Alistair Moffat, Timothy A. H. Bell : In Situ Generation of Compressed Inverted Files. JASIS 46 (7): 537-550 (1995) 37 Justin Zobel , Alistair Moffat: Adding Compression to a Full-text Retrieval System. Software - Practice and Experience 25 (8): 891-903 (1995) 36 Andrew Turpin , Alistair Moffat: Practical Length-limited Coding for Large Alphabets. The Computer Journal 38 (5): 339-347 (1995) 35 Ian H. Witten , Alistair Moffat, Timothy C. Bell : Managing Gigabytes: Compressing and Indexing Documents and Images. Van Nostrand Reinhold 1994 34 Alistair Moffat, Justin Zobel : Self-Indexing Inverted Files. Australasian Database Conference 1994 : 79-91 33 Ian H. Witten , Alistair Moffat, Timothy C. Bell : Compression and Full-Text Indexing for Digital Libraries. DL 1994 : 181-201 32 Alistair Moffat, Neil Sharman , Justin Zobel : Static Compression for Dynamic Texts. Data Compression Conference 1994 : 126-135 31 Alistair Moffat, Justin Zobel : Fast Ranking in Limited Space. ICDE 1994 : 428-437 30 Alistair Moffat, Justin Zobel : Information Retrieval Systems for Large Document Collections. TREC 1994 : 0- 29 Alistair Moffat, Justin Zobel : Compression and Fast Indexing for Multi-Gigabyte Text Databases. Australian Computer Journal 26 (1): 1-9 (1994) 28 Alistair Moffat, Justin Zobel , Ron Sacks-Davis : Memory Efficient Ranking. Information Processing and Management 30 (6): 733-744 (1994) 27 Alistair Moffat, Neil Sharman , Ian H. Witten , Timothy C. Bell : An Empirical Evaluation of Coding Methods for Multi-symbol Alphabets. Information Processing and Management 30 (6): 791-804 (1994) 26 Ian H. Witten , Timothy C. Bell , Alistair Moffat, Craig G. Nevill-Manning , Tony C. Smith , Harold W. Thimbleby : Semantic and Generative Models for Lossy Text Compression. The Computer Journal 37 (2): 83-87 (1994) 25 Justin Zobel , Alistair Moffat, Ron Sacks-Davis : Storage Management for Files of Dynamic Records. Australian Database Conference 1993 : 26-38 24 Alistair Moffat, Neil Sharman , Ian H. Witten , Timothy C. Bell : An Empirical Evaluation of Coding Techniques for Multi-Symbol Alphabets. Data Compression Conference 1993 : 108-117 23 Alistair Moffat, Ron Sacks-Davis , Ross Wilkinson , Justin Zobel : Retrieval of Partial Documents. TREC 1993 : 181-190 22 Justin Zobel , Alistair Moffat, Ron Sacks-Davis : Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files. VLDB 1993 : 290-301 21 Alistair Moffat, Justin Zobel : Supporting Random Access in Files of Variable Length Records. Information Processing Letters 46 (2): 71-77 (1993) 20 Alistair Moffat, Ola Petersson : Historical Searching. International Journal of Foundations of Computer Science 4 (1): 85-98 (1993) 19 Timothy C. Bell , Alistair Moffat, Craig G. Nevill-Manning , Ian H. Witten , Justin Zobel : Data Compression in Full-Text Retrieval Systems. JASIS 44 (9): 508-531 (1993) 18 Ian H. Witten , Timothy C. Bell , M. E. Harrison , Mark L. James , Alistair Moffat: Textual Image Compression. Data Compression Conference 1992 : 42-51 17 Alistair Moffat, Justin Zobel : Coding for Compression in Full-Text Retrieval Systems. Data Compression Conference 1992 : 72-81 16 Alistair Moffat, Ola Petersson , Nicholas C. Wormald : Sorting and/by Merging Finger Trees. ISAAC 1992 : 499-508 15 Alistair Moffat, Justin Zobel : Parameterised Compression for Sparse Bitmaps. SIGIR 1992 : 274-285 14 Ola Petersson , Alistair Moffat: A Framework for Adaptive Sorting. SWAT 1992 : 422-433 13 Alan J. Kent , Alistair Moffat, Ron Sacks-Davis , Ross Wilkinson , Justin Zobel : Compression, Fast Indexing, and Structured Queries on a Gigabyte of Text. TREC 1992 : 229-244 12 Justin Zobel , Alistair Moffat, Ron Sacks-Davis : An Efficient Indexing Technique for Full Text Databases. VLDB 1992 : 352-362 11 Alistair Moffat, Ola Petersson : An Overview of Adaptive Sorting. Australian Computer Journal 24 (2): 70-77 (1992) 10 Alistair Moffat: Economical Inversion of Large Text Files. Computing Systems 5 (2): 125-139 (1992) 9 Alistair Moffat: Two-Level Context Based Compression of Binary Images. Data Compression Conference 1991 : 382-391 8 Alistair Moffat, Ola Petersson : Historical Searching and Sorting. ISA 1991 : 263-272 7 Graeme Port , Alistair Moffat: A Fast Algorithm for Melding Splay Trees. WADS 1989 : 450-459 6 Alistair Moffat: Word-based Text Compression. Software - Practice and Experience 19 (2): 185-198 (1989) 5 Timothy C. Bell , Alistair Moffat: A Note on the DMC Data Compression Scheme. The Computer Journal 32 (1): 16-20 (1989) 4 Alistair Moffat, Tadao Takaoka : An All Pairs Shortest Path Algorithm with Expected Time O(n² log n). SIAM J. Comput. 16 (6): 1023-1031 (1987) 3 Alistair Moffat, Tadao Takaoka : An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n). FOCS 1985 : 101-105 2 Alistair Moffat, Tadao Takaoka : A Priority Queue for the All Pairs Shortest Path Problem. Information Processing Letters 18 (4): 189-193 (1984) 1 Tadao Takaoka , Alistair Moffat: An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem. MFCS 1980 : 643-655  DiSC'02 © 2003 Association for Computing Machinery |
