| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Gordon V. Cormack Thomas R. Lynam , Chris Buckley , Charles L. A. Clarke , Gordon V. Cormack: A multi-system analysis of document and term selection for blind feedback. CIKM 2004 : 261-269 David L. Yeung , Charles L. A. Clarke , Gordon V. Cormack, Thomas R. Lynam , Egidio L. Terra : Task-Specific Query Expansion (MultiText Experiments for TREC 2003). TREC 2003 : 810-819 Brad Lushman , Gordon V. Cormack: Proof of correctness of Ressel's adOPTed algorithm. Inf. Process. Lett. 86 (6): 303-310 (2003) Charles L. A. Clarke , Gordon V. Cormack, M. Laszlo , Thomas R. Lynam , Egidio L. Terra : The impact of corpus size on question answering performance. SIGIR 2002 : 369-370 Charles L. A. Clarke , Gordon V. Cormack, Graeme Kemkes , M. Laszlo , Thomas R. Lynam , Egidio L. Terra , Philip L. Tilker : Statistical Selection of Exact Answers (MultiText Experiments for TREC 2002). TREC 2002 Charles L. A. Clarke , Gordon V. Cormack, Thomas R. Lynam : Exploiting Redundancy in Question Answering. SIGIR 2001 : 358-365 Charles L. A. Clarke , Gordon V. Cormack, Thomas R. Lynam , C. M. Li , G. L. McLearn : Web Reinforced Question Answering (MultiTest Experiments for TREC 2001). TREC 2001 Charles L. A. Clarke , Gordon V. Cormack, D. I. E. Kisman , Thomas R. Lynam : Question Answering by Passage Selection (MultiText Experiments for TREC-9). TREC 2000 Charles L. A. Clarke , Gordon V. Cormack: Shortest-substring retrieval and ranking. ACM Trans. Inf. Syst. 18 (1): 44-78 (2000) Gordon V. Cormack, Charles L. A. Clarke , Christopher R. Palmer , Samuel S. L. To : Passage-based query refinement (MultiText experiments for TREC-6). Inf. Process. Manage. 36 (1): 133-153 (2000) Charles L. A. Clarke , Gordon V. Cormack, Elizabeth A. Tudhope : Relevance ranking for one to three term queries. Inf. Process. Manage. 36 (2): 291-311 (2000) Gordon V. Cormack, Ondrej Lhoták , Christopher R. Palmer : Estimating Precision by Random Sampling (poster abstract). SIGIR 1999 : 273-274 Gordon V. Cormack, Charles L. A. Clarke , Christopher R. Palmer , Robert C. Good : The MultiText Retrieval System (demonstration abstract). SIGIR 1999 : 334 Gordon V. Cormack, Charles L. A. Clarke , D. I. E. Kisman , Christopher R. Palmer : Fast Automatic Passage Ranking (MultiText Experiments for TREC-8). TREC 1999 Christopher R. Palmer , Gordon V. Cormack: Operation Transforms for a Distributed Shared Spreadsheet. CSCW 1998 : 69-78 Gordon V. Cormack, Christopher R. Palmer , Charles L. A. Clarke : Efficient Construction of Large Test Collections. SIGIR 1998 : 282-289 Gordon V. Cormack, Christopher R. Palmer , Michael Van Biesbrouck , Charles L. A. Clarke : Deriving Very Short Queries for High Precision and Recall (MultiText Experiments for TREC-7). TREC 1998 : 68-79 Charles L. A. Clarke , Gordon V. Cormack, Christopher R. Palmer : An Overview of MultiText. SIGIR Forum 32 (2): 14-15 (1998) Gordon V. Cormack, Charles L. A. Clarke , Christopher R. Palmer , Samuel S. L. To : Passage-Based Refinement (MultiText Experiements for TREC-6). TREC 1997 : 303-319 Charles L. A. Clarke , Gordon V. Cormack: On the Use of Regular Expressions for Searching Text. ACM Trans. Program. Lang. Syst. 19 (3): 413-426 (1997) Charles L. A. Clarke , Gordon V. Cormack: Interactive Substring Retrieval (MultiText Experiments for TREC-5). TREC 1996 Dominic Duggan , Gordon V. Cormack, John Ophel : Kinded Type Inference for Parametric Overloading. Acta Inf. 33 (1): 21-68 (1996) Gordon V. Cormack: A Calculus for Concurrent Update (Abstract). PODC 1995 : 269 Charles L. A. Clarke , Gordon V. Cormack, Forbes J. Burkowski : Shortest Substring Ranking (MultiText Experiments for TREC-4). TREC 1995 Charles L. A. Clarke , Gordon V. Cormack, Forbes J. Burkowski : An Algebra for Structured Text Search and a Framework for its Implementation. Comput. J. 38 (1): 43-56 (1995) Jun Shen , Gordon V. Cormack, Dominic Duggan : On Abstraction and Sharing in Generic Modules. COODBSE 1994 : 22-41 Jun Shen , Gordon V. Cormack: Access Control for Private Declarations in Ada. Comput. Lang. 20 (2): 117-126 (1994) R. Nigel Horspool , Gordon V. Cormack: Constructing Word-Based Text Compression Algorithms. Data Compression Conference 1992 : 62-71 Forbes J. Burkowski , Gordon V. Cormack: Use of Perfect Hashing in a Paged Memory Management Unit. ICPP (1) 1990 : 96-100 Gordon V. Cormack, Andrew K. Wright : Type-Dependent Parameter Inference. PLDI 1990 : 127-136 G. D. P. Dueck , Gordon V. Cormack: Modular Attribute Grammars. Comput. J. 33 (2): 164-172 (1990) Forbes J. Burkowski , Gordon V. Cormack, G. D. P. Dueck : Architectural Support for Synchronous Task Communication. ASPLOS 1989 : 40-53 Gordon V. Cormack: An LR Substring Parser for Noncorrecting Syntax Error Recovery. PLDI 1989 : 161-169 Daniel J. Salomon , Gordon V. Cormack: Scannerless NSLR(1) Parsing of Programming Languages. PLDI 1989 : 170-178 Daniel J. Salomon , Gordon V. Cormack: Corrections to the paper: Scannerless NSLR(1) Parsing of Programming Languages. SIGPLAN Notices 24 (11): 80-83 (1989) Gordon V. Cormack: A Micro-Kernel for Concurrency in C. Softw., Pract. Exper. 18 (5): 485-491 (1988) Gordon V. Cormack, R. Nigel Horspool : Data Compression Using Dynamic Markov Modelling. Comput. J. 30 (6): 541-550 (1987) Thomas Strothotte , Gordon V. Cormack: Structured Program Lookahead. Comput. Lang. 12 (2): 95-108 (1987) R. Nigel Horspool , Gordon V. Cormack: Hashing as a Compaction Technique for LR Parser Tables. Softw., Pract. Exper. 17 (6): 413-416 (1987) Gordon V. Cormack: Data Compression on a Database System. Commun. ACM 28 (12): 1336-1342 (1985) Gordon V. Cormack, R. Nigel Horspool , M. Kaiserswerth : Practical Perfect Hashing. Comput. J. 28 (1): 54-58 (1985) Gordon V. Cormack, R. Nigel Horspool : Algorithms for Adaptive Huffman Codes. Inf. Process. Lett. 18 (3): 159-165 (1984) 1 [ 26 ] 2 [ 42 ] 3 [ 11 ] [ 14 ] [ 18 ] [ 19 ] 4 [ 18 ] [ 19 ] [ 22 ] [ 23 ] [ 24 ] [ 25 ] [ 26 ] [ 27 ] [ 29 ] [ 30 ] [ 32 ] [ 33 ] [ 34 ] [ 35 ] [ 36 ] [ 37 ] [ 38 ] [ 39 ] [ 41 ] [ 42 ] 5 [ 11 ] [ 12 ] 6 [ 17 ] [ 21 ] 7 [ 30 ] 8 [ 1 ] [ 2 ] [ 4 ] [ 6 ] [ 15 ] 9 [ 2 ] 10 [ 38 ] 11 [ 29 ] [ 35 ] 12 [ 38 ] [ 39 ] 13 [ 31 ] 14 [ 36 ] 15 [ 40 ] 16 [ 35 ] [ 36 ] [ 37 ] [ 38 ] [ 39 ] [ 41 ] [ 42 ] 17 [ 36 ] 18 [ 21 ] 19 [ 24 ] [ 25 ] [ 26 ] [ 27 ] [ 28 ] [ 29 ] [ 30 ] [ 31 ] [ 33 ] 20 [ 8 ] [ 9 ] 21 [ 16 ] [ 17 ] 22 [ 5 ] 23 [ 38 ] [ 39 ] [ 41 ] 24 [ 38 ] 25 [ 24 ] [ 33 ] 26 [ 32 ] 27 [ 13 ] 28 [ 41 ]  ©2005 Association for Computing Machinery |
