2005 |
43 | EE | Raf M. Podowski,
John G. Cleary,
Nicholas T. Goncharoff,
Gregory Amoutzias,
William S. Hayes:
Suregene, a Scalable System for Automated Term Disambiguation of Gene and Protein Names.
J. Bioinformatics and Computational Biology 3(3): 743-770 (2005) |
2004 |
42 | EE | Raf M. Podowski,
John G. Cleary,
Nicholas T. Goncharoff,
Gregory Amoutzias,
William S. Hayes:
AZuRE, a Scalable System for Automated Term Disambiguation of Gene and Protein Names.
CSB 2004: 415-424 |
2002 |
41 | EE | Roger Clayton,
John G. Cleary,
Bernhard Pfahringer,
Mark Utting:
Tabling Structures for Bottom-Up Logic Programming.
LOPSTR 2002: 50-51 |
40 | EE | Xiao Zhonge,
Rob Simmonds,
Brian Unger,
John G. Cleary:
Parallel and distributed simulation: fast cell level ATM network simulation.
Winter Simulation Conference 2002: 712-719 |
2000 |
39 | EE | Brian Unger,
Zhonge Xiao,
John G. Cleary,
Jya-Jang Tsai,
Carey L. Williamson:
Parallel shared-memory simulator performance for large ATM networks.
ACM Trans. Model. Comput. Simul. 10(4): 358-391 (2000) |
1999 |
38 | EE | John G. Cleary,
W. J. Teahan:
An Open Interface for Probabilistic Models of Text.
Data Compression Conference 1999: 522 |
37 | | Lunjin Lu,
John G. Cleary:
A Regular Type Analysis of Logic Programs.
ICLP 1999: 613 |
36 | | Lunjin Lu,
John G. Cleary:
An Operational Semantics of Starlog.
PPDP 1999: 294-310 |
35 | EE | Xiao Zhonge,
Brian Unger,
Rob Simmonds,
John G. Cleary:
Scheduling Critical Channels in Conservative Parallel Discrete Event Simulation.
Workshop on Parallel and Distributed Simulation 1999: 20-28 |
1998 |
34 | EE | W. J. Teahan,
Stuart Inglis,
John G. Cleary,
Geoffrey Holmes:
Correcting English Text Using PPM Models.
Data Compression Conference 1998: 289-298 |
33 | EE | W. J. Teahan,
John G. Cleary:
Tag Based Models of English Text.
Data Compression Conference 1998: 43-52 |
32 | EE | John G. Cleary,
Lunjin Lu:
Constructive Negation Using Typed Existence Properties.
PLILP/ALP 1998: 411-426 |
31 | EE | Lunjin Lu,
John G. Cleary:
On Dart-Zobel Algorithm for Testing Regular Type Inclusion
CoRR cs.LO/9810001: (1998) |
30 | EE | Lunjin Lu,
John G. Cleary:
An Emptiness Algorithm for Regular Types with Set Operators
CoRR cs.LO/9811015: (1998) |
1997 |
29 | | W. J. Teahan,
John G. Cleary:
Models of English Text.
Data Compression Conference 1997: 12-21 |
28 | EE | Fabian Gomes,
Brian Unger,
John G. Cleary,
Steve Franks:
Multiplexed State Saving for Bounded Rollback.
Winter Simulation Conference 1997: 460-467 |
27 | EE | John G. Cleary,
Jya-Jang Tsai:
Performance of a Conservative Simulator of ATM Networks.
Workshop on Parallel and Distributed Simulation 1997: 142-145 |
26 | EE | Steve Franks,
Fabian Gomes,
Brian Unger,
John G. Cleary:
State Saving for Interactive Optimistic Simulation.
Workshop on Parallel and Distributed Simulation 1997: 72-79 |
25 | EE | John G. Cleary,
J. A. David McWha,
Murray Pearson:
Timestamp Representations for Virtual Sequences.
Workshop on Parallel and Distributed Simulation 1997: 98-105 |
24 | | John G. Cleary,
W. J. Teahan:
Unbounded Length Contexts for PPM.
Comput. J. 40(2/3): 67-75 (1997) |
23 | | John G. Cleary:
Constructive Negation of Arithmetic Constraints Using Dataflow Graphs.
Constraints 2(2): 131-162 (1997) |
1996 |
22 | | W. J. Teahan,
John G. Cleary:
The Entropy of English Using PPM-based Models.
Data Compression Conference 1996: 53-62 |
21 | EE | Fabian Gomes,
Brian Unger,
John G. Cleary:
Language Based State Saving Extensions for Optimistic Parallel Simulation.
Winter Simulation Conference 1996: 794-800 |
20 | EE | John G. Cleary,
Jya-Jang Tsai:
Conservative Parallel Simulation of ATM Networks.
Workshop on Parallel and Distributed Simulation 1996: 30-38 |
1995 |
19 | | John G. Cleary,
W. J. Teahan,
Ian H. Witten:
Unbounded Length Contexts for PPM.
Data Compression Conference 1995: 52-61 |
18 | EE | John G. Cleary,
Murray Pearson,
Husam Kinawi:
The architecture of an optimistic CPU: the WarpEngine.
HICSS (1) 1995: 163-172 |
17 | | John G. Cleary,
Leonard E. Trigg:
K*: An Instance-based Learner Using and Entropic Distance Measure.
ICML 1995: 108-114 |
16 | EE | Darrin West,
John G. Cleary,
Jim Hofmann,
Larry Mellon,
Jim Ramsey:
Infrastructure for Rapid Execution of Strike-Planning Systems.
Winter Simulation Conference 1995: 1207-1214 |
15 | EE | Fabian Gomes,
John G. Cleary,
Alan Covington,
Steve Franks,
Brian Unger,
Xiao Zhonge:
SimKit: A High Performance Logical Process Simulation Class Library in C++.
Winter Simulation Conference 1995: 706-713 |
14 | EE | John G. Cleary,
Sean A. Irvine,
Ingrid Rinsma-Melchert:
On the insecurity of arithmetic coding.
Computers & Security 14(2): 167-180 (1995) |
1993 |
13 | EE | Brian Unger,
John G. Cleary,
Alan Covington,
Darrin West:
An external state management system for optimistic parallel simulation.
Winter Simulation Conference 1993: 750-755 |
12 | | John J. Darragh,
John G. Cleary,
Ian H. Witten:
Bonsai: a Compact Representation of Trees.
Softw., Pract. Exper. 23(3): 277-291 (1993) |
1992 |
11 | | Ian Olthof,
John G. Cleary:
AND-Parallel Prolog on a Transputer-Based System.
IJCSLP Workshop on Concurrent and Parallel Implementations 1992 |
1989 |
10 | | Timothy C. Bell,
Ian H. Witten,
John G. Cleary:
Modeling for Text Compression.
ACM Comput. Surv. 21(4): 557-591 (1989) |
1988 |
9 | | John G. Cleary,
Geoff Wyvill:
Analysis of an algorithm for fast ray tracing using uniform space subdivision.
The Visual Computer 4(2): 65-83 (1988) |
1987 |
8 | | Ian H. Witten,
Radford M. Neal,
John G. Cleary:
Arithmetic Coding for Data Compression.
Commun. ACM 30(6): 520-540 (1987) |
7 | | John G. Cleary:
Acquisition of Uncertain Rules in a Probabilistic Logic.
International Journal of Man-Machine Studies 27(2): 145-154 (1987) |
1986 |
6 | | Alan D. Dewar,
John G. Cleary:
Graphical Display of Complex Information within a Prolog Debugger.
International Journal of Man-Machine Studies 25(5): 503-521 (1986) |
1984 |
5 | | John G. Cleary:
Compact Hash Tables Using Bidirectional Linear Probing.
IEEE Trans. Computers 33(9): 828-834 (1984) |
4 | | John G. Cleary,
Ian H. Witten:
A comparison of enumerative and adaptive codes.
IEEE Transactions on Information Theory 30(2): 306-315 (1984) |
3 | | Ian H. Witten,
John G. Cleary,
Saul Greenberg:
On Frequency-Based Menu-Splitting Algorithms.
International Journal of Man-Machine Studies 21(2): 135-148 (1984) |
1983 |
2 | | Ian H. Witten,
Graham M. Birtwistle,
John G. Cleary,
David R. Hill,
Danny Levinson,
Greg Lomow,
Radford M. Neal,
Murray Peterson,
Brian Unger,
Brian Wyvill:
Jade: A Distributed Software Prototyping Environment.
Operating Systems Review 17(3): 10-23 (1983) |
1979 |
1 | EE | John G. Cleary:
Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space.
ACM Trans. Math. Softw. 5(2): 183-192 (1979) |