default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew Turpin
Person information
- affiliation: University of Melbourne, School of Computing and Information Systems, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j25]Shima Rashidi
, Weilun Xu, Dian Lin, Andrew Turpin, Lars Kulik, Krista A. Ehinger:
An active foveated gaze prediction algorithm based on a Bayesian ideal observer. Pattern Recognit. 143: 109694 (2023)- 2021
- [j24]Ziying Yang, Gosia Mikolajczak, Andrew Turpin:
ConTEXT Explorer: a web-based text analysis tool for exploring and visualizing concepts across time. J. Open Source Softw. 6(68): 3347 (2021) - [c72]Shima Khanehzar, Trevor Cohn, Gosia Mikolajczak, Andrew Turpin, Lea Frermann:
Framing Unpacked: A Semi-Supervised Interpretable Multi-View Model of Media Frames. NAACL-HLT 2021: 2154-2166 - [c71]Andrew Turpin, Paul Gruba:
Developing a workforce to support research reliant on data and compute (keynote extended abstract). DAMDID/RCDL (Supplementary Proceedings) 2021: 3-9 - [i2]Shima Khanehzar, Trevor Cohn, Gosia Mikolajczak, Andrew Turpin, Lea Frermann:
Framing Unpacked: A Semi-Supervised Interpretable Multi-View Model of Media Frames. CoRR abs/2104.11030 (2021) - 2020
- [c70]Shima Rashidi, Krista A. Ehinger, Andrew Turpin, Lars Kulik:
Optimal visual search based on a model of target detectability in natural images. NeurIPS 2020
2010 – 2019
- 2019
- [c69]Shima Khanehzar, Andrew Turpin, Gosia Mikolajczak:
Modeling Political Framing Across Policy Issues and Contexts. ALTA 2019: 61-66 - [c68]Silviana Tana, Christoph F. Breidbach, Andrew Turpin:
I Want a Lamborghini: an ethnography of Cryptocurrency Communities. ECIS 2019 - [c67]Maria Torres Pena, Christoph F. Breidbach, Andrew Turpin:
Crafting Agent-based Models to Analyze Service Platforms. ICIS 2019 - 2018
- [c66]Maria Veronica Torres Pena, Christoph F. Breidbach, Andrew Turpin:
Self-Organizing Service Ecosystems: Exploring a New Concept for Service Science. ACIS 2018: 44 - [c65]Ziying Yang, Alistair Moffat, Andrew Turpin:
Pairwise Crowd Judgments: Preference, Absolute, and Ratio. ADCS 2018: 3:1-3:8 - 2017
- [j23]Md. Akter Hussain, Alauddin Bhuiyan, Andrew Turpin, Chi D. Luu, R. Theodore Smith, Robyn H. Guymer, Kotagiri Ramamohanarao:
Automatic Identification of Pathology-Distorted Retinal Layer Boundaries Using SD-OCT Imaging. IEEE Trans. Biomed. Eng. 64(7): 1638-1649 (2017) - [j22]Eddy Maddalena, Stefano Mizzaro, Falk Scholer, Andrew Turpin:
On Crowdsourcing Relevance Magnitudes for Information Retrieval Evaluation. ACM Trans. Inf. Syst. 35(3): 19:1-19:32 (2017) - [c64]George Buchanan, Dana McKay, Eduardo Velloso, Alistair Moffat, Andrew Turpin, Falk Scholer:
Only forward?: toward understanding human visual behaviour when examining search results. OZCHI 2017: 497-502 - 2016
- [j21]Rodrigo Cánovas, Alistair Moffat, Andrew Turpin:
CSAM: Compressed SAM format. Bioinform. 32(24): 3709-3716 (2016) - [c63]Ziying Yang, Alistair Moffat, Andrew Turpin:
How Precise Does Document Scoring Need to Be? AIRS 2016: 279-291 - 2015
- [j20]Lorena Leal Bando, Falk Scholer, Andrew Turpin:
Query-biased summary generation assisted by query expansion. J. Assoc. Inf. Sci. Technol. 66(5): 961-979 (2015) - [c62]Timothy Jones, Falk Scholer, Andrew Turpin, Stefano Mizzaro, Mark Sanderson:
Different Rankers on Different Subcollections. ECIR 2015: 203-208 - [c61]Eddy Maddalena, Stefano Mizzaro, Falk Scholer, Andrew Turpin:
Judging Relevance Using Magnitude Estimation. ECIR 2015: 215-220 - [c60]Andrew Turpin, Falk Scholer, Stefano Mizzaro, Eddy Maddalena:
The Benefits of Magnitude Estimation Relevance Assessments for Information Retrieval Evaluation. SIGIR 2015: 565-574 - 2014
- [j19]Rodrigo Cánovas, Alistair Moffat, Andrew Turpin:
Lossy compression of quality scores in genomic data. Bioinform. 30(15): 2130-2136 (2014) - [j18]Mingfang Wu, Andrew Turpin, James A. Thom, Falk Scholer, Ross Wilkinson:
Cost and benefit estimation of experts' mediation in an enterprise search. J. Assoc. Inf. Sci. Technol. 65(1): 146-163 (2014) - [j17]Steven Burrows, Alexandra L. Uitdenbogerd, Andrew Turpin:
Comparing techniques for authorship attribution of source code. Softw. Pract. Exp. 44(1): 1-32 (2014) - [j16]Simon Gog, Alistair Moffat, J. Shane Culpepper, Andrew Turpin, Anthony Wirth:
Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays. IEEE Trans. Knowl. Data Eng. 26(8): 1918-1931 (2014) - [c59]Timothy Jones, Andrew Turpin, Stefano Mizzaro, Falk Scholer, Mark Sanderson:
Size and Source Matter: Understanding Inconsistencies in Test Collection-Based Evaluation. CIKM 2014: 1843-1846 - [c58]Matias I. Maturana, Andrew Turpin, Allison M. McKendrick, Tatiana Kameneva:
Ionic channel changes in glaucomatous retinal ganglion cells: Multicompartment modeling. EMBC 2014: 4535-4538 - [c57]Falk Scholer, Eddy Maddalena, Stefano Mizzaro, Andrew Turpin:
Magnitudes of Relevance: Relevance Judgements, Magnitude Estimation, and Crowdsourcing. EVIA@NTCIR 2014 - 2013
- [i1]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) - 2012
- [j15]Mingfang Wu, David Hawking, Andrew Turpin, Falk Scholer:
Using anchor text for homepage and topic distillation search tasks. J. Assoc. Inf. Sci. Technol. 63(6): 1235-1255 (2012) - [j14]Jasbir Dhaliwal, Simon J. Puglisi, Andrew Turpin:
Practical Efficient String Mining. IEEE Trans. Knowl. Data Eng. 24(4): 735-744 (2012) - [c56]Jasbir Dhaliwal, Simon J. Puglisi, Andrew Turpin:
Trends in Suffix Sorting: A Survey of Low Memory Algorithms. ACSC 2012: 91-98 - [c55]Lorena Leal Bando, Falk Scholer, Andrew Turpin:
Sentence length bias in TREC novelty track judgements. ADCS 2012: 55-61 - [c54]Andrew Turpin:
An attempt to measure the quality of questions in question time of the Australian Federal Parliament. ADCS 2012: 96-103 - [c53]Mark Sanderson, Andrew Turpin, Ying Zhang, Falk Scholer:
Differences in effectiveness across sub-collections. CIKM 2012: 1965-1969 - 2011
- [j13]Sarvnaz Karimi, Falk Scholer, Andrew Turpin:
Machine transliteration survey. ACM Comput. Surv. 43(3): 17:1-17:46 (2011) - [j12]Mingfang Wu, Falk Scholer, Andrew Turpin:
Topic Distillation with Query-Dependent Link Connections and Page Characteristics. ACM Trans. Web 5(2): 6:1-6:25 (2011) - [c52]Falk Scholer, Andrew Turpin, Mark Sanderson:
Quantifying test collection quality based on the consistency of relevance judgements. SIGIR 2011: 1063-1072 - 2010
- [c51]Mingfang Wu, Andrew Turpin, Simon J. Puglisi, Falk Scholer, James A. Thom:
Presenting Query Aspects to Support Exploratory Search. AUIC 2010: 23-32 - [c50]J. Shane Culpepper, Gonzalo Navarro, Simon J. Puglisi, Andrew Turpin:
Top-k Ranked Document Search in General Text Databases. ESA (2) 2010: 194-205 - [c49]Lorena Leal Bando, Falk Scholer, Andrew Turpin:
Constructing query-biased summaries: a comparison of human and system generated snippets. IIiX 2010: 195-204
2000 – 2009
- 2009
- [c48]Serdar Boztas, Simon J. Puglisi, Andrew Turpin:
Testing Stream Ciphers by Finding the Longest Substring of a Given Density. ACISP 2009: 122-133 - [c47]Falk Scholer, Andrew Turpin:
Metric and Relevance Mismatch in Retrieval Evaluation. AIRS 2009: 50-62 - [c46]Steven Burrows, Alexandra L. Uitdenbogerd, Andrew Turpin:
Temporally Robust Software Features for Authorship Attribution. COMPSAC (1) 2009: 599-606 - [c45]Steven Burrows, Alexandra L. Uitdenbogerd, Andrew Turpin:
Application of Information Retrieval Techniques for Source Code Authorship Attribution. DASFAA 2009: 699-713 - [c44]Yohannes Tsegay, Simon J. Puglisi, Andrew Turpin, Justin Zobel:
Document Compaction for Efficient Query Biased Snippet Generation. ECIR 2009: 509-520 - [c43]Arathi Arakala, J. Shane Culpepper, Jason Jeffers, Andrew Turpin, Serdar Boztas, Kathy J. Horadam, Allison M. McKendrick:
Entropy of the Retina Template. ICB 2009: 1250-1259 - [c42]Mingfang Wu, James A. Thom, Andrew Turpin, Ross Wilkinson:
Cost and benefit analysis of mediated enterprise search. JCDL 2009: 267-276 - [c41]Andrew Turpin, Falk Scholer, Kalervo Järvelin, Mingfang Wu, J. Shane Culpepper:
Including summaries in system evaluation. SIGIR 2009: 508-515 - [c40]Travis Gagie, Simon J. Puglisi, Andrew Turpin:
Range Quantile Queries: Another Virtue of Wavelet Trees. SPIRE 2009: 1-6 - 2008
- [c39]Mingfang Wu, Andrew Turpin, Justin Zobel:
An investigation on a community's web search variability. ACSC 2008: 117-126 - [c38]Falk Scholer, Milad Shokouhi, Bodo Billerbeck, Andrew Turpin:
Using Clicks as Implicit Judgments: Expectations Versus Observations. ECIR 2008: 28-39 - [c37]Milad Shokouhi, Falk Scholer, Andrew Turpin:
Investigating the Effectiveness of Clickthrough Data for Document Reordering. ECIR 2008: 591-595 - [c36]Simon J. Puglisi, Andrew Turpin:
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation. ISAAC 2008: 124-135 - [c35]Falk Scholer, Andrew Turpin, Mingfang Wu:
Measuring User Relevance Criteria. EVIA@NTCIR 2008 - [c34]Falk Scholer, Andrew Turpin:
Relevance thresholds in system evaluations. SIGIR 2008: 693-694 - [c33]Mingfang Wu, Falk Scholer, Andrew Turpin:
User preference choices for complex question answering. SIGIR 2008: 717-718 - [c32]Mingfang Wu, Andrew Turpin, Justin Zobel:
Aggregated click-through data in a homogeneous user community. SIGIR 2008: 731-732 - [c31]Ranjan Sinha, Simon J. Puglisi, Alistair Moffat, Andrew Turpin:
Improving suffix array locality for fast pattern matching on disk. SIGMOD Conference 2008: 661-672 - [c30]Ying Zhang, Falk Scholer, Andrew Turpin:
RMIT University at TREC 2008: Legal Track. TREC 2008 - [e2]Amihood Amir, Andrew Turpin, Alistair Moffat:
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 [contents] - 2007
- [j11]Simon J. Puglisi, William F. Smyth, Andrew Turpin:
A taxonomy of suffix array construction algorithms. ACM Comput. Surv. 39(2): 4 (2007) - [c29]Sarvnaz Karimi, Falk Scholer, Andrew Turpin:
Collapsed Consonant and Vowel Models: New Approaches for English-Persian Transliteration and Back-Transliteration. ACL 2007 - [c28]Sarvnaz Karimi, Andrew Turpin, Falk Scholer:
Corpus Effects on the Evaluation of Automated Transliteration Systems. ACL 2007 - [c27]Yohannes Tsegay, Andrew Turpin, Justin Zobel:
Dynamic index pruning for effective caching. CIKM 2007: 987-990 - [c26]Andrew Turpin, Yohannes Tsegay, David Hawking, Hugh E. Williams:
Fast generation of result snippets in web search. SIGIR 2007: 127-134 - [c25]Hamid Abdul Basit, Simon J. Puglisi, William F. Smyth, Andrew Turpin, Stan Jarzabek:
Efficient token based clone detection with flexible tokenization. ESEC/SIGSOFT FSE 2007: 513-516 - [c24]Mingfang Wu, Andrew Turpin, Falk Scholer, Yohannes Tsegay, Ross Wilkinson:
TREC 2007 ciQA Track at RMIT and CSIRO. TREC 2007 - 2006
- [j10]Andrew Turpin, Falk Scholer, Bodo Billerbeck, Larry Abel:
Examining the Pseudo-Standard Web Search Engine Results Page. Aust. J. Intell. Inf. Process. Syst. 9(2): 9-16 (2006) - [j9]Kangmin Fan, Simon J. Puglisi, William F. Smyth, Andrew Turpin:
A New Periodicity Lemma. SIAM J. Discret. Math. 20(3): 656-668 (2006) - [c23]Simon J. Puglisi, William F. Smyth, Andrew Turpin:
Suffix arrays: what are they good for? ADC 2006: 17-18 - [c22]Steven Garcia, Andrew Turpin:
Efficient Query Evaluation Through Access-Reordering. AIRS 2006: 106-118 - [c21]Andrew Turpin, Falk Scholer:
User performance versus precision measures for simple search tasks. SIGIR 2006: 11-18 - [c20]Simon J. Puglisi, William F. Smyth, Andrew Turpin:
Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory. SPIRE 2006: 122-133 - [c19]Sarvnaz Karimi, Andrew Turpin, Falk Scholer:
English to Persian Transliteration. SPIRE 2006: 255-266 - 2005
- [c18]Simon J. Puglisi, William F. Smyth, Andrew Turpin:
The Performance of Linear Time Suffix Sorting Algorithms. DCC 2005: 358-367 - [c17]Shuanghui Meng, Mihai M. Lazarescu, Jim Ivins, Andrew Turpin:
Monitoring Glaucomatous Progression: Classification of Visual Field Measurements Using Stable Reference Data. ICMLC 2005: 750-759 - [c16]Simon J. Puglisi, William F. Smyth, Andrew Turpin:
A taxonomy of suffix array construction algorithms. Stringology 2005: 1-30 - 2004
- [j8]Falk Scholer, Hugh E. Williams, Andrew Turpin:
Query association surrogates for Web search. J. Assoc. Inf. Sci. Technol. 55(7): 637-650 (2004) - [c15]Andrew Turpin, William R. Hersh:
Do Clarity Scores for Queries Correlate with User Performance? ADC 2004: 85-91 - [e1]Peter Bruza, Alistair Moffat, Andrew Turpin:
ADCS 2004, Proceedings of the Ninth Australasian Document Computing Symposium, Melbourne, Australia, December 13, 2004. University of Melbourne, Department of Computer Science 2004, ISBN 0-9757172-0-0 [contents] - 2003
- [c14]Mihai M. Lazarescu, Andrew Turpin:
Classifying Glaucomatous Progression using Decision Trees. Applied Informatics 2003: 205-209 - 2002
- [b1]Alistair Moffat, Andrew Turpin:
Compression and Coding Algorithms. The international series in engineering and computer science 669, Kluwer 2002, ISBN 0-7923-7668-4, pp. I-XII, 1-275 - [c13]Andrew Turpin, William F. Smyth:
An Approach to Phrase Selection for Offline Data Compression. ACSC 2002: 267-273 - [c12]Andrew Turpin, William R. Hersh:
User interface effects in past batch versus user experiments. SIGIR 2002: 431-432 - [c11]Mihai M. Lazarescu, Andrew Turpin, Svetha Venkatesh:
An Application of Machine Learning Techniques for the Classification of Glaucomatous Progression. SSPR/SPR 2002: 243-251 - 2001
- [j7]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. Manag. 37(3): 383-402 (2001) - [j6]Andrew Turpin, Alistair Moffat:
On-line adaptive canonical prefix coding with bounded compression loss. IEEE Trans. Inf. Theory 47(1): 88-98 (2001) - [c10]Andrew Turpin, Eibe Frank, Mark A. Hall, Ian H. Witten, Chris A. Johnson:
Determining Progression in Glaucoma Using Visual Fields. PAKDD 2001: 136-147 - [c9]Andrew Turpin, William R. Hersh:
Why Batch and User Evaluations Do Not Give the Same Results. SIGIR 2001: 225-231 - 2000
- [j5]Andrew Turpin, Alistair Moffat:
Housekeeping for prefix coding. IEEE Trans. Commun. 48(4): 622-628 (2000) - [c8]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 - [c7]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
1990 – 1999
- 1999
- [c6]Andrew Turpin, Alistair Moffat:
Statistical Phrases for Vector-Space Information Retrieval (poster abstract). SIGIR 1999: 309-310 - [c5]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 - 1998
- [j4]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) - [j3]Alistair Moffat, Andrew Turpin:
Efficient Construction of Minimum-Redundancy Codes for Large Alphabets. IEEE Trans. Inf. Theory 44(4): 1650-1657 (1998) - 1997
- [j2]Alistair Moffat, Andrew Turpin:
On the implementation of minimum redundancy prefix codes. IEEE Trans. Commun. 45(10): 1200-1207 (1997) - [c4]Andrew Turpin, Alistair Moffat:
Efficient Approximate Adaptive Coding. Data Compression Conference 1997: 357-366 - 1996
- [c3]Alistair Moffat, Andrew Turpin:
On the Implementation of Minimum-Redundancy Prefix Codes. Data Compression Conference 1996: 170-179 - 1995
- [j1]Andrew Turpin, Alistair Moffat:
Practical Length-limited Coding for Large Alphabets. Comput. J. 38(5): 339-347 (1995) - [c2]Alistair Moffat, Andrew Turpin, Jyrki Katajainen:
Space-Efficient Construction of Optimal Prefix Codes. Data Compression Conference 1995: 192-201 - [c1]Jyrki Katajainen, Alistair Moffat, Andrew Turpin:
A Fast and Space - Economical Algorithm for Length - Limited Coding. ISAAC 1995: 12-21
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-24 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
