![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Hugh E. Williams Falk Scholer , Hugh E. Williams, Andrew Turpin : Query association surrogates for Web search. JASIST 55 (7): 637-650 (2004) Hugh E. Williams: Genomic Information Retrieval. ADC 2003 : 27-35 Bodo Billerbeck , Falk Scholer , Hugh E. Williams, Justin Zobel : Query expansion using associated queries. CIKM 2003 : 2-9 Vaughan R. Shanks , Hugh E. Williams: Index construction for linear categorisation. CIKM 2003 : 334-341 Andrew G. Fry , Hugh E. Williams: Comparing the Overhead Requirements of Database Transaction Models. DEXA 2003 : 318-329 Halil Ali , Hugh E. Williams: What's Changed? Measuring Document Change in Web Crawling for Search Engines. SPIRE 2003 : 28-42 Wahyu Wibowo , Hugh E. Williams: Simple and accurate feature selection for hierarchical categorisation. ACM Symposium on Document Engineering 2002 : 111-118 Falk Scholer , Hugh E. Williams: Query association for effective retrieval. CIKM 2002 : 324-331 Wahyu Wibowo , Hugh E. Williams: Strategies for minimising errors in hierarchical web categorisation. CIKM 2002 : 525-531 Dirk Bahle , Hugh E. Williams, Justin Zobel : Efficient phrase querying with an auxiliary index. SIGIR 2002 : 215-221 Falk Scholer , Hugh E. Williams, John Yiannis , Justin Zobel : Compression of inverted indexes for fast query evaluation. SIGIR 2002 : 222-229 Seyed M. M. Tahaghoghi , James A. Thom , Hugh E. Williams: Multiple Example Queries in Content-Based Image Retrieval. SPIRE 2002 : 227-240 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) Adam Cannane , Hugh E. Williams: A general-purpose compression scheme for large collections. ACM Trans. Inf. Syst. 20 (3): 329-355 (2002) Hugh E. Williams, Justin Zobel : Indexing and Retrieval for Genomic Databases. IEEE Trans. Knowl. Data Eng. 14 (1): 63-78 (2002) Seyed M. M. Tahaghoghi , James A. Thom , Hugh E. Williams: Are two pictures better than one? ADC 2001 : 138-144 V. Shanks , Hugh E. Williams: Fast Categorisation of Large Document Collections. SPIRE 2001 : 194-204 Dennis Bahle , Hugh E. Williams, Justin Zobel : Compaction Techniques for Nextword Indexes. SPIRE 2001 : 33-45 Adam Cannane , Hugh E. Williams: General-purpose compression for efficient retrieval. JASIST 52 (5): 430-437 (2001) Hugh E. Williams, Justin Zobel , Steffen Heinz : Self-adjusting trees in practice for large text collections. Softw., Pract. Exper. 31 (10): 925-939 (2001) Adam Cannane , Hugh E. Williams: A Compression Scheme for Large Databases. Australasian Database Conference 2000 : 6-11 Hugh E. Williams: Book review: Information retrieval: Algorithms and heuristics, by David A. Grossman and Ophir Frieder. JASIS 51 (11): 1063-1064 (2000) Hugh E. Williams, Justin Zobel , Phil Anderson : What's Next? Index Structures for Efficient Phrase Querying. Australasian Database Conference 1999 : 141-152 Adam Cannane , Hugh E. Williams, Justin Zobel : A General-Purpose Compression Scheme for Databases. Data Compression Conference 1999 : 519 Hugh E. Williams: Effective Query Filtering for Fast Homology Searching. Pacific Symposium on Biocomputing 1999 : 214-225 Justin Zobel , Hugh E. Williams: Compact In-Memory Models for Compression of Large Text Databases. SPIRE/CRIWG 1999 : 224-231 Hugh E. Williams, Justin Zobel : Compressing Integers for Fast File Access. Comput. J. 42 (3): 193-201 (1999) Hugh E. Williams: Cafe: An Indexed Approach to Searching Genomic Databases. SIGIR 1998 : 389 Hugh E. Williams, Justin Zobel : Compression of nucleotide databases for fast searching. Computer Applications in the Biosciences 13 (5): 549-554 (1997) Hugh E. Williams, Justin Zobel : Indexing Nucleotide Databases for Fast Query Evaluation. EDBT 1996 : 275-288 1 [ 25 ] 2 [ 8 ] 3 [ 13 ] 4 [ 21 ] 5 [ 28 ] 6 [ 7 ] [ 10 ] [ 12 ] [ 17 ] 7 [ 26 ] 8 [ 11 ] [ 18 ] 9 [ 20 ] [ 23 ] [ 28 ] [ 30 ] 10 [ 14 ] 11 [ 27 ] 12 [ 15 ] [ 19 ] 13 [ 15 ] [ 19 ] 14 [ 30 ] 15 [ 22 ] [ 24 ] 16 [ 20 ] 17 [ 1 ] [ 2 ] [ 4 ] [ 5 ] [ 7 ] [ 8 ] [ 11 ] [ 13 ] [ 16 ] [ 18 ] [ 20 ] [ 21 ] [ 28 ] ![]() ©2004 Association for Computing Machinery |