Andrew Turpin

Simon Gog, Alistair Moffat, J. Shane Culpepper, Andrew Turpin, Anthony Wirth: Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays. CoRR abs/1303.6481 (2013)

Mingfang Wu, David Hawking, Andrew Turpin, Falk Scholer: Using anchor text for homepage and topic distillation search tasks. JASIST 63(6): 1235-1255 (2012)

Jasbir Dhaliwal, Simon J. Puglisi, Andrew Turpin: Practical Efficient String Mining. IEEE Trans. Knowl. Data Eng. 24(4): 735-744 (2012)

Jasbir Dhaliwal, Simon J. Puglisi, Andrew Turpin: Trends in Su x Sorting: A Survey of Low Memory Algorithms. ACSC 2012: 91-98

Lorena Leal Bando, Falk Scholer, Andrew Turpin: Sentence length bias in TREC novelty track judgements. ADCS 2012: 55-61

Andrew Turpin: An attempt to measure the quality of questions in question time of the Australian Federal Parliament. ADCS 2012: 96-103

Mark Sanderson, Andrew Turpin, Ying Zhang, Falk Scholer: Differences in effectiveness across sub-collections. CIKM 2012: 1965-1969

Sarvnaz Karimi, Falk Scholer, Andrew Turpin: Machine transliteration survey. ACM Comput. Surv. 43(3): 17 (2011)

Mingfang Wu, Falk Scholer, Andrew Turpin: Topic Distillation with Query-Dependent Link Connections and Page Characteristics. TWEB 5(2): 6 (2011)

Falk Scholer, Andrew Turpin, Mark Sanderson: Quantifying test collection quality based on the consistency of relevance judgements. SIGIR 2011: 1063-1072

Mingfang Wu, Andrew Turpin, Simon J. Puglisi, Falk Scholer, James A. Thom: Presenting Query Aspects to Support Exploratory Search. AUIC 2010: 23-32

J. Shane Culpepper, Gonzalo Navarro, Simon J. Puglisi, Andrew Turpin: Top-k Ranked Document Search in General Text Databases. ESA (2) 2010: 194-205

Serdar Boztas, Simon J. Puglisi, Andrew Turpin: Testing Stream Ciphers by Finding the Longest Substring of a Given Density. ACISP 2009: 122-133

Falk Scholer, Andrew Turpin: Metric and Relevance Mismatch in Retrieval Evaluation. AIRS 2009: 50-62

Steven Burrows, Alexandra L. Uitdenbogerd, Andrew Turpin: Temporally Robust Software Features for Authorship Attribution. COMPSAC (1) 2009: 599-606

Steven Burrows, Alexandra L. Uitdenbogerd, Andrew Turpin: Application of Information Retrieval Techniques for Source Code Authorship Attribution. DASFAA 2009: 699-713

Yohannes Tsegay, Simon J. Puglisi, Andrew Turpin, Justin Zobel: Document Compaction for Efficient Query Biased Snippet Generation. ECIR 2009: 509-520

Arathi Arakala, J. Shane Culpepper, Jason Jeffers, Andrew Turpin, Serdar Boztas, Kathy J. Horadam, A. M. McKendrick: Entropy of the Retina Template. ICB 2009: 1250-1259

Mingfang Wu, James A. Thom, Andrew Turpin, Ross Wilkinson: Cost and benefit analysis of mediated enterprise search. JCDL 2009: 267-276

Andrew Turpin, Falk Scholer, Kalvero Jarvelin, Mingfang Wu, J. Shane Culpepper: Including summaries in system evaluation. SIGIR 2009: 508-515

Travis Gagie, Simon J. Puglisi, Andrew Turpin: Range Quantile Queries: Another Virtue of Wavelet Trees. SPIRE 2009: 1-6

Mingfang Wu, Andrew Turpin, Justin Zobel: An investigation on a community's web search variability. ACSC 2008: 117-126

Falk Scholer, Milad Shokouhi, Bodo Billerbeck, Andrew Turpin: Using Clicks as Implicit Judgments: Expectations Versus Observations. ECIR 2008: 28-39

Milad Shokouhi, Falk Scholer, Andrew Turpin: Investigating the Effectiveness of Clickthrough Data for Document Reordering. ECIR 2008: 591-595

Simon J. Puglisi, Andrew Turpin: Space-Time Tradeoffs for Longest-Common-Prefix Array Computation. ISAAC 2008: 124-135

Falk Scholer, Andrew Turpin: Relevance thresholds in system evaluations. SIGIR 2008: 693-694

Mingfang Wu, Falk Scholer, Andrew Turpin: User preference choices for complex question answering. SIGIR 2008: 717-718

Mingfang Wu, Andrew Turpin, Justin Zobel: Aggregated click-through data in a homogeneous user community. SIGIR 2008: 731-732

Ranjan Sinha, Simon J. Puglisi, Alistair Moffat, Andrew Turpin: Improving suffix array locality for fast pattern matching on disk. SIGMOD Conference 2008: 661-672

Ying Zhang, Falk Scholer, Andrew Turpin: RMIT University at TREC 2008: Legal Track. TREC 2008

Amihood Amir, Andrew Turpin, Alistair Moffat (Eds.): String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings. Lecture Notes in Computer Science 5280, Springer 2008, isbn 978-3-540-89096-6

Simon J. Puglisi, William F. Smyth, Andrew Turpin: A taxonomy of suffix array construction algorithms. ACM Comput. Surv. 39(2) (2007)

Sarvnaz Karimi, Falk Scholer, Andrew Turpin: Collapsed Consonant and Vowel Models: New Approaches for English-Persian Transliteration and Back-Transliteration. ACL 2007

Sarvnaz Karimi, Andrew Turpin, Falk Scholer: Corpus Effects on the Evaluation of Automated Transliteration Systems. ACL 2007

Yohannes Tsegay, Andrew Turpin, Justin Zobel: Dynamic index pruning for effective caching. CIKM 2007: 987-990

Andrew Turpin, Yohannes Tsegay, David Hawking, Hugh E. Williams: Fast generation of result snippets in web search. SIGIR 2007: 127-134

Hamid Abdul Basit, Simon J. Puglisi, William F. Smyth, Andrew Turpin, Stan Jarzabek: Efficient token based clone detection with flexible tokenization. ESEC/SIGSOFT FSE (Companion) 2007: 513-516

Mingfang Wu, Andrew Turpin, Falk Scholer, Yohannes Tsegay, Ross Wilkinson: TREC 2007 ciQA Track at RMIT and CSIRO. TREC 2007

Kangmin Fan, Simon J. Puglisi, William F. Smyth, Andrew Turpin: A New Periodicity Lemma. SIAM J. Discrete Math. 20(3): 656-668 (2006)

Simon J. Puglisi, William F. Smyth, Andrew Turpin: Suffix arrays: what are they good for? ADC 2006: 17-18

Steven Garcia, Andrew Turpin: Efficient Query Evaluation Through Access-Reordering. AIRS 2006: 106-118

Andrew Turpin, Falk Scholer: User performance versus precision measures for simple search tasks. SIGIR 2006: 11-18

Simon J. Puglisi, William F. Smyth, Andrew Turpin: Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory. SPIRE 2006: 122-133

Sarvnaz Karimi, Andrew Turpin, Falk Scholer: English to Persian Transliteration. SPIRE 2006: 255-266

Simon J. Puglisi, William F. Smyth, Andrew Turpin: The Performance of Linear Time Suffix Sorting Algorithms. DCC 2005: 358-367

Shuanghui Meng, Mihai Lazarescu, Jim Ivins, Andrew Turpin: Monitoring Glaucomatous Progression: Classification of Visual Field Measurements Using Stable Reference Data. ICMLC 2005: 750-759

Simon J. Puglisi, William F. Smyth, Andrew Turpin: A taxonomy of suffix array construction algorithms. Stringology 2005: 1-30

Falk Scholer, Hugh E. Williams, Andrew Turpin: Query association surrogates for Web search. JASIST 55(7): 637-650 (2004)

Andrew Turpin, William R. Hersh: Do Clarity Scores for Queries Correlate with User Performance? ADC 2004: 85-91

Peter Bruza, Alistair Moffat, Andrew Turpin (Eds.): ADCS 2004, Proceedings of the Ninth Australasian Document Computing Symposium, December 13, 2004. University of Melbourne, Department of Computer Science 2004, isbn 0-9757172-0-0

Mihai Lazarescu, Andrew Turpin: Classifying Glaucomatous Progression using Decision Trees. Applied Informatics 2003: 205-209

Alistair Moffat, Andrew Turpin: Compression and Coding Algorithms. Kluwer 2002, isbn 0-7923-7668-4

Andrew Turpin, William F. Smyth: An Approach to Phrase Selection for Offline Data Compression. ACSC 2002: 267-273

Andrew Turpin, William R. Hersh: User interface effects in past batch versus user experiments. SIGIR 2002: 431-432

Mihai Lazarescu, Andrew Turpin, Svetha Venkatesh: An Application of Machine Learning Techniques for the Classification of Glaucomatous Progression. SSPR/SPR 2002: 243-251

William R. Hersh, Andrew Turpin, Susan Price, Dale Kraemer, Daniel Olson, Benjamin Chan, Lynetta Sacherek: Challenging conventional assumptions of automated information retrieval with real users: Boolean searching and batch retrieval evaluations. Inf. Process. Manage. 37(3): 383-402 (2001)

Andrew Turpin, Alistair Moffat: On-line adaptive canonical prefix coding with bounded compression loss. IEEE Transactions on Information Theory 47(1): 88-98 (2001)

Andrew Turpin, Eibe Frank, Mark Hall, Ian H. Witten, Chris A. Johnson: Determining Progression in Glaucoma Using Visual Fields. PAKDD 2001: 136-147

Andrew Turpin, William R. Hersh: Why Batch and User Evaluations Do Not Give the Same Results. SIGIR 2001: 225-231

Andrew Turpin, Alistair Moffat: Housekeeping for prefix coding. IEEE Transactions on Communications 48(4): 622-628 (2000)

William R. Hersh, Andrew Turpin, Susan Price, Benjamin Chan, Dale Kraemer, Lynetta Sacherek, Daniel Olson: Do batch and user evaluation give the same results? SIGIR 2000: 17-24

William R. Hersh, Andrew Turpin, Lynetta Sacherek, Daniel Olson, Susan Price, Benjamin Chan, Dale Kraemer: Further Analysis of Whether Batch and User Evaluations Give the Same Results with a Question-Answering Task. TREC 2000

Andrew Turpin, Alistair Moffat: Statistical Phrases for Vector-Space Information Retrieval (poster abstract). SIGIR 1999: 309-310

William R. Hersh, Andrew Turpin, Susan Price, Dale Kraemer, Benjamin Chan, Lynetta Sacherek, Daniel Olson: Do Batch and User Evaluations Give the Same Results? An Analysis from the TREC-8 Interactive Track. TREC 1999

Andrew Turpin, Alistair Moffat: Comment on ``Efficient Huffman Decoding'' and ``An Efficient Finite-State Machine Implementation of Huffman Decoders''. Inf. Process. Lett. 68(1): 1-2 (1998)

Alistair Moffat, Andrew Turpin: Efficient Construction of Minimum-Redundancy Codes for Large Alphabets. IEEE Transactions on Information Theory 44(4): 1650-1657 (1998)

Alistair Moffat, Andrew Turpin: On the implementation of minimum redundancy prefix codes. IEEE Transactions on Communications 45(10): 1200-1207 (1997)

Andrew Turpin, Alistair Moffat: Efficient Approximate Adaptive Coding. Data Compression Conference 1997: 357-366

Alistair Moffat, Andrew Turpin: On the Implementation of Minimum-Redundancy Prefix Codes. Data Compression Conference 1996: 170-179

Andrew Turpin, Alistair Moffat: Practical Length-limited Coding for Large Alphabets. Comput. J. 38(5): 339-347 (1995)

Alistair Moffat, Andrew Turpin, Jyrki Katajainen: Space-Efficient Construction of Optimal Prefix Codes. Data Compression Conference 1995: 192-201

Jyrki Katajainen, Alistair Moffat, Andrew Turpin: A Fast and Space - Economical Algorithm for Length - Limited Coding. ISAAC 1995: 12-21