| 2007 |
|---|
| 42 | EE | Minh Duc Cao,
Trevor I. Dix,
Lloyd Allison,
Chris Mears:
A Simple Statistical Algorithm for Biological Sequence Compression.
DCC 2007: 43-52 |
| 2006 |
|---|
| 41 | EE | Lloyd Allison:
A programming paradigm for machine learning, with a case study of Bayesian networks.
ACSC 2006: 103-111 |
| 40 | EE | Rodney T. O'Donnell,
Lloyd Allison,
Kevin B. Korb:
Learning Hybrid Bayesian Networks by MML.
Australian Conference on Artificial Intelligence 2006: 192-203 |
| 2005 |
|---|
| 39 | EE | Lloyd Allison:
Models for machine learning and data mining in functional programming.
J. Funct. Program. 15(1): 15-32 (2005) |
| 2004 |
|---|
| 38 | EE | David R. Powell,
Lloyd Allison,
Trevor I. Dix:
Modelling-Alignment for Non-random Sequences.
Australian Conference on Artificial Intelligence 2004: 203-214 |
| 2003 |
|---|
| 37 | EE | Lloyd Allison:
Types and Classes of Machine Learning and Data Mining.
ACSC 2003: 207-215 |
| 36 | EE | Leigh J. Fitzgibbon,
Lloyd Allison,
Joshua W. Comley:
Probability Model Type Sufficiency.
IDEAL 2003: 530-534 |
| 35 | EE | Joshua W. Comley,
Lloyd Allison,
Leigh J. Fitzgibbon:
Flexible Decision Trees in a General Data-Mining Environment.
IDEAL 2003: 761-767 |
| 34 | | Lloyd Allison:
Longest Biased Interval and Longest Non-negative Sum Interval.
Bioinformatics 19(10): 1294-1295 (2003) |
| 2002 |
|---|
| 33 | | Leigh J. Fitzgibbon,
David L. Dowe,
Lloyd Allison:
Univariate Polynomial Inference by Monte Carlo Message Length Approximation.
ICML 2002: 147-154 |
| 32 | EE | Leigh J. Fitzgibbon,
David L. Dowe,
Lloyd Allison:
Change-Point Estimation Using New Minimum Message Length Approximations.
PRICAI 2002: 244-254 |
| 2000 |
|---|
| 31 | EE | Leigh J. Fitzgibbon,
Lloyd Allison,
David L. Dowe:
Minimum Message Length Grouping of Ordered Data.
ALT 2000: 56-70 |
| 30 | EE | Lloyd Allison:
Intelligent Systems in Molecular Biology (ISMB98), 27 June - 1 July, 1998, Montreal.
Computers & Chemistry 24(1): 129-132 (2000) |
| 29 | EE | Lloyd Allison,
Linda Stern,
Timothy Edgoose,
Trevor I. Dix:
Sequence Complexity for Biological Sequence Analysis.
Computers & Chemistry 24(1): 43-55 (2000) |
| 28 | | Lloyd Allison:
Generator and Search Objects in Java.
Journal of Research and Practice in Information Technology 32(1): 3-12 (2000) |
| 1999 |
|---|
| 27 | | Lloyd Allison,
David R. Powell,
Trevor I. Dix:
Compression and Approximate Matching.
Comput. J. 42(1): 1-10 (1999) |
| 26 | EE | David R. Powell,
Lloyd Allison,
Trevor I. Dix:
A Versatile Divide and Conquer Technique for Optimal String Alignment.
Inf. Process. Lett. 70(3): 127-139 (1999) |
| 1998 |
|---|
| 25 | EE | Timothy Edgoose,
Lloyd Allison:
Minimum Message Length Hidden Markov Modelling.
Data Compression Conference 1998: 169-178 |
| 24 | | Lloyd Allison,
Timothy Edgoose,
Trevor I. Dix:
Compression of Strings with Approximate Repeats.
ISMB 1998: 8-16 |
| 23 | | David L. Dowe,
Lloyd Allison,
Glen Pringle:
The Hunter and the Hunted - Modelling the Relationship Between Web Pages and Search Engines.
PAKDD 1998: 380-382 |
| 22 | EE | Glen Pringle,
Lloyd Allison,
David L. Dowe:
What is a Tall Poppy Among Web Pages?
Computer Networks 30(1-7): 369-377 (1998) |
| 1994 |
|---|
| 21 | | Toni Kazic,
David J. States,
Lloyd Allison:
Motifs in Biology: Analysis of Ambiguous Data: Introduction.
HICSS (5) 1994: 224 |
| 20 | | Lloyd Allison:
Using Hirschberg's Algorithm to Generate Random Alignments of Strings.
Inf. Process. Lett. 51(5): 251-255 (1994) |
| 1993 |
|---|
| 19 | EE | Alan Finlay,
Lloyd Allison:
A Correction to the Denotational Semantics for the Prolog of Nicholson and Foo.
ACM Trans. Program. Lang. Syst. 15(1): 206-208 (1993) |
| 18 | | Lloyd Allison:
Applications of Recursively Defined Data Structures.
Australian Computer Journal 25(1): 14-20 (1993) |
| 17 | | Chut N. Yee,
Lloyd Allison:
Reconstruction of strings past.
Computer Applications in the Biosciences 9(1): 1-7 (1993) |
| 1992 |
|---|
| 16 | | Lloyd Allison:
Lazy Dynamic-Programming Can Be Eager.
Inf. Process. Lett. 43(4): 207-212 (1992) |
| 1991 |
|---|
| 15 | | Lloyd Allison,
Trevor I. Dix,
Chut N. Yee:
Shortest Path and Closure Algorithms for Banded Matrices.
Inf. Process. Lett. 40(6): 317-322 (1991) |
| 1990 |
|---|
| 14 | | Lloyd Allison:
Continuations Implement Generators and Streams.
Comput. J. 33(5): 460-465 (1990) |
| 13 | | S. T. Ho,
Lloyd Allison,
Chut N. Yee:
Restriction site mapping for three or more enzymes.
Computer Applications in the Biosciences 6(3): 195-204 (1990) |
| 1989 |
|---|
| 12 | | C. McDonald,
Lloyd Allison:
Denotational Semantics of a Command Interpreter and Their Implementation in Standard ML.
Comput. J. 32(5): 422-431 (1989) |
| 11 | | Lloyd Allison:
Direct Semantics and Exceptions Define Jumps and Coroutines.
Inf. Process. Lett. 31(6): 327-330 (1989) |
| 10 | | Lloyd Allison:
Circular Programs and Self-referential Structures.
Softw., Pract. Exper. 19(2): 99-109 (1989) |
| 1988 |
|---|
| 9 | | Lloyd Allison:
Some Applications of Continuations.
Comput. J. 31(1): 9-11 (1988) |
| 8 | | Lloyd Allison,
Chut N. Yee:
Restriction site mapping is in separation theory.
Computer Applications in the Biosciences 4(1): 97-101 (1988) |
| 1986 |
|---|
| 7 | | Lloyd Allison,
Trevor I. Dix:
A Bit-String Longest-Common-Subsequence Algorithm.
Inf. Process. Lett. 23(6): 305-310 (1986) |
| 1985 |
|---|
| 6 | | Lloyd Allison:
Programming Denotational Semantics II.
Comput. J. 28(5): 480-486 (1985) |
| 1983 |
|---|
| 5 | | Lloyd Allison:
Programming Denotational Semantics.
Comput. J. 26(2): 164-174 (1983) |
| 4 | | Lloyd Allison:
Stable Marriages by Coroutines.
Inf. Process. Lett. 16(2): 61-65 (1983) |
| 3 | | Lloyd Allison:
Syntax Directed Program Editing.
Softw., Pract. Exper. 13(5): 453-465 (1983) |
| 1981 |
|---|
| 2 | | Lloyd Allison:
Generating Coset Representatives for Permutation Groups.
J. Algorithms 2(3): 227-244 (1981) |
| 1978 |
|---|
| 1 | | Lloyd Allison:
Phrase Structures, Non-Determinism and Backtracking.
Inf. Process. Lett. 7(3): 139-143 (1978) |
