default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHugh E. Williams
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c43]Hugh E. Williams, Selina Williams, Kristy Kendall:
CS in Schools: Developing a sustainable Coding Programme in Australian Schools. ITiCSE 2020: 321-327
2010 – 2019
- 2014
- [c42]Hugh E. Williams:
The data revolution: how companies are transforming with big data. SIGIR 2014: 525-526
2000 – 2009
- 2007
- [b4]Seyed M. M. Tahaghoghi, Hugh E. Williams:
Learning MySQL - get a handle on your data. O'Reilly 2007, ISBN 978-0-596-00864-2, pp. I-XVII, 1-598 - [j19]Michael Cameron, Yaniv Bernstein, Hugh E. Williams:
Clustered Sequence Representation for Fast Homology Search. J. Comput. Biol. 14(5): 594-614 (2007) - [j18]Mirna Adriani, Jelita Asian, Bobby A. A. Nazief, Seyed M. M. Tahaghoghi, Hugh E. Williams:
Stemming Indonesian: A confix-stripping approach. ACM Trans. Asian Lang. Inf. Process. 6(4): 1-33 (2007) - [j17]Michael Cameron, Hugh E. Williams:
Comparing Compressed Sequences for Faster Nucleotide BLAST Searches. IEEE ACM Trans. Comput. Biol. Bioinform. 4(3): 349-364 (2007) - [c41]Andrew Turpin, Yohannes Tsegay, David Hawking, Hugh E. Williams:
Fast generation of result snippets in web search. SIGIR 2007: 127-134 - 2006
- [j16]Nicholas Lester, Justin Zobel, Hugh E. Williams:
Efficient online index maintenance for contiguous inverted lists. Inf. Process. Manag. 42(4): 916-933 (2006) - [j15]Michael Cameron, Hugh E. Williams, Adam Cannane:
A Deterministic Finite Automaton for Faster Protein Hit Detection in BLAST. J. Comput. Biol. 13(4): 965-978 (2006) - [c40]Michael Cameron, Yaniv Bernstein, Hugh E. Williams:
Clustering Near-Identical Sequences for Fast Homology Search. RECOMB 2006: 175-189 - 2005
- [j14]Hugh E. Williams, Justin Zobel:
Searchable words on the Web. Int. J. Digit. Libr. 5(2): 99-105 (2005) - [j13]Hugh E. Williams:
Introduction to genomic information retrieval. ACM Trans. Inf. Syst. 23(1): 1-2 (2005) - [c39]Seyed M. M. Tahaghoghi, Hugh E. Williams, James A. Thom, Timo Volkmer:
Video Cut Detection using Frame Windows. ACSC 2005: 193-200 - [c38]Jelita Asian, Hugh E. Williams, Seyed M. M. Tahaghoghi:
Stemming Indonesian. ACSC 2005: 307-314 - [e2]Hugh E. Williams, Gillian Dobbie:
Database Technologies 2005, Proceedings of the Sixteenth Australasian Database Conference, ADC 2005, Newcastle, Australia, January 31st - February 3rd 2005. CRPIT 39, Australian Computer Society 2005, ISBN 1-920682-21-X [contents] - 2004
- [b3]Hugh E. Williams, David Lane:
Web database applications with PHP and MySQL - building effective database-driven web sites: covers PEAR, PHP 5, and MySQL 4.1 (2. ed.). O'Reilly 2004, ISBN 978-0-596-00543-6, pp. I-XVIII, 1-796 - [j12]Falk Scholer
, Hugh E. Williams, Andrew Turpin:
Query association surrogates for Web search. J. Assoc. Inf. Sci. Technol. 55(7): 637-650 (2004) - [j11]Michael Cameron, Hugh E. Williams, Adam Cannane:
Improved Gapped Alignment in BLAST. IEEE ACM Trans. Comput. Biol. Bioinform. 1(3): 116-129 (2004) - [j10]Hugh E. Williams, Justin Zobel, Dirk Bahle:
Fast phrase querying with combined indexes. ACM Trans. Inf. Syst. 22(4): 573-594 (2004) - [c37]Steven Garcia, Hugh E. Williams, Adam Cannane:
Access-Ordered Indexes. ACSC 2004: 7-14 - [c36]Nicholas Lester, Justin Zobel, Hugh E. Williams:
In-Place versus Re-Build versus Re-Merge: Index Maintenance Strategies for Text Retrieval Systems. ACSC 2004: 15-22 - [c35]Jelita Asian, Hugh E. Williams, Seyed M. M. Tahaghoghi:
A Testbed for Indonesian Text Retrieval. ADCS 2004: 55-58 - [c34]Abhijit Chattaraj, Hugh E. Williams:
Variable-length Intervals in Homology Search. APBC 2004: 85-91 - [c33]Timo Volkmer, Seyed M. M. Tahaghoghi, Hugh E. Williams:
Gradual Transition Detection Using Average Frame Similarity. MDDE 2004 - [c32]Timo Volkmer, Seyed M. M. Tahaghoghi, Hugh E. Williams:
Gradual Transition Detection Using Average Frame Similarity. CVPR Workshops 2004: 139 - [c31]Amanda Clare, Hugh E. Williams, Nicholas Lester:
Scalable Multi-Relational Association Mining. ICDM 2004: 355-358 - [c30]Seyed M. M. Tahaghoghi, James A. Thom, Hugh E. Williams:
Representing Colour for Computing Image Similarity. iiWAS 2004 - [c29]Bodo Billerbeck, Adam Cannane, Abhijit Chattaraj, Nicholas Lester, William Webber, Hugh E. Williams, John Yiannis, Justin Zobel:
RMIT University at TREC 2004. TREC 2004 - [c28]Timo Volkmer, Seyed M. M. Tahaghoghi, Hugh E. Williams:
RMIT University at TRECVID 2004. TRECVID 2004 - [e1]Klaus-Dieter Schewe, Hugh E. Williams:
Database Technologies 2004, Proceedings of the Fifteenth Australasian Database Conference, ADC 2004, Dunedin, New Zealand, 18-22 January 2004. CRPIT 27, Australian Computer Society 2004, ISBN 1-920682-06-6 [contents] - 2003
- [c27]Vaughan R. Shanks, Hugh E. Williams, Adam Cannane:
Indexing for Fast Categorisation. ACSC 2003: 119-127 - [c26]Hugh E. Williams:
Genomic Information Retrieval. ADC 2003: 27-35 - [c25]Bodo Billerbeck, Falk Scholer, Hugh E. Williams, Justin Zobel:
Query expansion using associated queries. CIKM 2003: 2-9 - [c24]Vaughan R. Shanks, Hugh E. Williams:
Index construction for linear categorisation. CIKM 2003: 334-341 - [c23]Andrew G. Fry, Hugh E. Williams:
Comparing the Overhead Requirements of Database Transaction Models. DEXA 2003: 318-329 - [c22]Halil Ali, Hugh E. Williams:
What's Changed? Measuring Document Change in Web Crawling for Search Engines. SPIRE 2003: 28-42 - [c21]Timo Volkmer, Seyed M. M. Tahaghoghi, Hugh E. Williams, James A. Thom:
The Moving Query Windows for Shot Boundary Detection at TREC-12. TRECVID 2003 - 2002
- [b2]George Reese, Randy Jay Yarger, Tim King, Hugh E. Williams:
Managing and using MySQL - covers version 4.0.1: a database optimized for speed and interactivity (2. ed.). O'Reilly 2002, ISBN 978-0-596-00211-4, pp. I-XIII, 1-425 - [b1]Hugh E. Williams, David Lane:
Web database applications with PHP and MySQL - building effective database-driven web-sites. O'Reilly 2002, ISBN 978-0-596-00041-7, pp. I-XVI, 1-563 - [j9]Hugh E. Williams, Justin Zobel:
Indexing and Retrieval for Genomic Databases. IEEE Trans. Knowl. Data Eng. 14(1): 63-78 (2002) - [j8]Steffen Heinz, Justin Zobel, Hugh E. Williams:
Burst tries: a fast, efficient data structure for string keys. ACM Trans. Inf. Syst. 20(2): 192-223 (2002) - [j7]Adam Cannane, Hugh E. Williams:
A general-purpose compression scheme for large collections. ACM Trans. Inf. Syst. 20(3): 329-355 (2002) - [c20]Andy Song, Vic Ciesielski, Hugh E. Williams:
Texture classifiers generated by genetic programming. IEEE Congress on Evolutionary Computation 2002: 243-248 - [c19]Falk Scholer, Hugh E. Williams:
Query association for effective retrieval. CIKM 2002: 324-331 - [c18]Wahyu Wibowo, Hugh E. Williams:
Strategies for minimising errors in hierarchical web categorisation. CIKM 2002: 525-531 - [c17]Wahyu Wibowo, Hugh E. Williams:
Simple and accurate feature selection for hierarchical categorisation. ACM Symposium on Document Engineering 2002: 111-118 - [c16]Dirk Bahle, Hugh E. Williams, Justin Zobel:
Efficient phrase querying with an auxiliary index. SIGIR 2002: 215-221 - [c15]Falk Scholer, Hugh E. Williams, John Yiannis, Justin Zobel:
Compression of inverted indexes for fast query evaluation. SIGIR 2002: 222-229 - [c14]Seyed M. M. Tahaghoghi, James A. Thom, Hugh E. Williams:
Multiple Example Queries in Content-Based Image Retrieval. SPIRE 2002: 227-240 - [c13]Seyed M. M. Tahaghoghi, James A. Thom, Hugh E. Williams:
Shot Boundary Detection Using the Moving Query Window. TREC 2002 - 2001
- [j6]Justin Zobel, Steffen Heinz, Hugh E. Williams:
In-memory hash tables for accumulating text vocabularies. Inf. Process. Lett. 80(6): 271-277 (2001) - [j5]Adam Cannane, Hugh E. Williams:
General-purpose compression for efficient retrieval. J. Assoc. Inf. Sci. Technol. 52(5): 430-437 (2001) - [j4]Hugh E. Williams, Justin Zobel, Steffen Heinz:
Self-adjusting trees in practice for large text collections. Softw. Pract. Exp. 31(10): 925-939 (2001) - [c12]Dirk Bahle, Hugh E. Williams, Justin Zobel:
Optimised Phrase Querying and Browsing of Large Text Databases. ACSC 2001: 11-19 - [c11]Seyed M. M. Tahaghoghi, James A. Thom, Hugh E. Williams:
Are two pictures better than one? ADC 2001: 138-144 - [c10]Dirk Bahle, Hugh E. Williams, Justin Zobel:
Compaction Techniques for Nextword Indexes. SPIRE 2001: 33-45 - [c9]Vaughan R. Shanks, Hugh E. Williams:
Fast Categorisation of Large Document Collections. SPIRE 2001: 194-204 - 2000
- [j3]Hugh E. Williams:
Book review: Information retrieval: Algorithms and heuristics, by David A. Grossman and Ophir Frieder. J. Am. Soc. Inf. Sci. 51(11): 1063-1064 (2000) - [c8]Justin Zobel, Hugh E. Williams, Sam Kimberley:
Trends in Retrieval System Performance. ACSC 2000: 241-248 - [c7]Adam Cannane, Hugh E. Williams:
A Compression Scheme for Large Databases. Australasian Database Conference 2000: 6-11
1990 – 1999
- 1999
- [j2]Hugh E. Williams, Justin Zobel:
Compressing Integers for Fast File Access. Comput. J. 42(3): 193-201 (1999) - [c6]Hugh E. Williams, Justin Zobel, Phil Anderson:
What's Next? Index Structures for Efficient Phrase Querying. Australasian Database Conference 1999: 141-152 - [c5]Adam Cannane, Hugh E. Williams, Justin Zobel:
A General-Purpose Compression Scheme for Databases. Data Compression Conference 1999: 519 - [c4]Hugh E. Williams:
Effective Query Filtering for Fast Homology Searching. Pacific Symposium on Biocomputing 1999: 214-225 - [c3]Justin Zobel, Hugh E. Williams:
Compact In-Memory Models for Compression of Large Text Databases. SPIRE/CRIWG 1999: 224-231 - 1998
- [c2]Hugh E. Williams:
Cafe: An Indexed Approach to Searching Genomic Databases. SIGIR 1998: 389 - 1997
- [j1]Hugh E. Williams, Justin Zobel:
Compression of nucleotide databases for fast searching. Comput. Appl. Biosci. 13(5): 549-554 (1997) - 1996
- [c1]Hugh E. Williams, Justin Zobel:
Indexing Nucleotide Databases for Fast Query Evaluation. EDBT 1996: 275-288
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 2025-01-21 00:11 CET 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:
