![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Hugh E. Williams 24 Hugh E. Williams: Genomic Information Retrieval. ADC 2003 : 27-35 23 Falk Scholer , Hugh E. Williams: Query association for effective retrieval. CIKM 2002 : 324-331 22 Wahyu Wibowo , Hugh E. Williams: Strategies for minimising errors in hierarchical web categorisation. CIKM 2002 : 525-531 21 Dirk Bahle , Hugh E. Williams, Justin Zobel : Efficient phrase querying with an auxiliary index. SIGIR 2002 : 215-221 20 Falk Scholer , Hugh E. Williams, John Yiannis , Justin Zobel : Compression of inverted indexes for fast query evaluation. SIGIR 2002 : 222-229 19 Seyed M. M. Tahaghoghi , James A. Thom , Hugh E. Williams: Multiple Example Queries in Content-Based Image Retrieval. SPIRE 2002 : 227-240 18 Hugh E. Williams, Justin Zobel : Indexing and Retrieval for Genomic Databases. TKDE 14 (1): 63-78 (2002) 17 Steffen Heinz , Justin Zobel , Hugh E. Williams: Burst tries: a fast, efficient data structure for string keys. TOIS 20 (2): 192-223 (2002) 16 Adam Cannane , Hugh E. Williams: A general-purpose compression scheme for large collections. TOIS 20 (3): 329-355 (2002) 15 Seyed M. M. Tahaghoghi , James A. Thom , Hugh E. Williams: Are two pictures better than one? ADC 2001 : 138-144 14 V. Shanks , Hugh E. Williams: Fast Categorisation of Large Document Collections. SPIRE 2001 : 194-204 13 Dennis Bahle , Hugh E. Williams, Justin Zobel : Compaction Techniques for Nextword Indexes. SPIRE 2001 : 33-45 12 Adam Cannane , Hugh E. Williams: General-purpose compression for efficient retrieval. JASIST 52 (5): 430-437 (2001) 11 Hugh E. Williams, Justin Zobel , Steffen Heinz : Self-adjusting trees in practice for large text collections. Software - Practice and Experience 31 (10): 925-939 (2001) 10 Adam Cannane , Hugh E. Williams: A Compression Scheme for Large Databases. Australasian Database Conference 2000 : 6-11 9 Hugh E. Williams: Book review: Information retrieval: Algorithms and heuristics, by David A. Grossman and Ophir Frieder. JASIS 51 (11): 1063-1064 (2000) 8 Hugh E. Williams, Justin Zobel , Phil Anderson : What's Next? Index Structures for Efficient Phrase Querying. Australasian Database Conference 1999 : 141-152 7 Adam Cannane , Hugh E. Williams, Justin Zobel : A General-Purpose Compression Scheme for Databases. Data Compression Conference 1999 : 519 6 Hugh E. Williams: Effective Query Filtering for Fast Homology Searching. Pacific Symposium on Biocomputing 1999 : 214-225 5 Justin Zobel , Hugh E. Williams: Compact In-Memory Models for Compression of Large Text Databases. SPIRE/CRIWG 1999 : 224-231 4 Hugh E. Williams, Justin Zobel : Compressing Integers for Fast File Access. The Computer Journal 42 (3): 193-201 (1999) 3 Hugh E. Williams: Cafe: An Indexed Approach to Searching Genomic Databases. SIGIR 1998 : 389 2 Hugh E. Williams, Justin Zobel : Compression of nucleotide databases for fast searching. Computer Applications in the Biosciences 13 (5): 549-554 (1997) 1 Hugh E. Williams, Justin Zobel : Indexing Nucleotide Databases for Fast Query Evaluation. EDBT 1996 : 275-288 ![]() DiSC'03 © 2003 Association for Computing Machinery |