 | ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr94-06.ps.gz, 19940730
A Network which Performs Orthonormalized Principal Subspace Extraction Technical Report 94/06 Mark D. Plumbley Department of Computer Science King's College London Strand, London WC2R 2LS, UK Email: mark@dcs.kcl.ac.uk July 25, 1994 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr94-09.ps.gz, 19941117
Towards Optimal Learning from Very Small Data Sets Technical Report 94/09 M. D. Plumbley Department of Computer Science King's College London Strand, London WC2R 2LS, UK mark@dcs.kcl.ac.uk September 19, 1994 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr94-08.ps.gz, 19941117
A Subspace Network that Determines its own Output Dimension Technical Report 94/08 Mark D. Plumbley Department of Computer Science King's College London Strand, London WC2R 2LS, UK Tel: +44 71 873 2241 Fax: +44 71 873 2851 Email: mark@dcs.kcl.ac.uk August 1994 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr94-11.ps.gz, 19941201
Common subsequences and supersequences and their expected length Vlado Dan<=c k Department of Computer Science, King's College London London WC2R 2LS, England |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr91-03.ps.gz, 19951020
What Really Makes Some Problems Moderately Hard Alan Hutchinson Dept. of Computer Science, Kings' College London 21 May 1991 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr95-08.ps.gz, 19951020
An example of first order meta logic: Godel's diagonal lemma Alan Hutchinson King's College London July 1995 This note provides an example of a first order meta-theorem and an outline of its meta-proof. It depends on the ideas in Hutchinson (1994), herein called FOMT. Numbered propositions and other |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr91-10.ps.gz, 19951020
Data Types in occam91 Alan Hutchinson King's College London October 1991 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr91-15.ps.gz, 19951020
Combining object and meta level search using built in tasks Alan Hutchinson Department of Computing King's College London (3rd. revision) 15 January 1992 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr92-05.ps.gz, 19951020
Adjusting Bias for Inductive Inference of Recursive Rules Alan Hutchinson Department of Computer Science King's College London 17 September 1992 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr91-14.ps.gz, 19951020
Entropy May Mislead Alan Hutchinson Department of Computing, King's College London 31 January 1992 Entropy and information theory are often quoted in support of learning algorithms. Among such are the annealing algorithm for Boltzmann machines (Hinton, Sejnowski & Ackley ), algorithms which |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr91-04.ps.gz, 19951026
First Order Meta Theories Alan Hutchinson Department of Computer Science King's College London June 1991; (revised) 3 December 1993 Contents Introduction Constituents of a language Examples of languages Variables, binders and substitutions Purpose of the meta-language of L The meta-language The |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr95-10.ps.gz, 19951103
Two-dimensional Prefix String Matching and Covering on Square Matrices Maxime Crochemore Costas S. Iliopoulosy Maureen Kordaz August 1995 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr94-03.ps.gz, 19951128
Performance Implications of Virtualisation of Massively Parallel Algorithm Implementation C.A. Farrell1 D.H. Kieronska2 Department of Computer Science, Curtin University, Perth, Australia. M.Korda3 Department of Computer Science, King's College London, London, UK. March 1994 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr95-09.ps.gz, 19951219
Existence and Intuitionistic A-Elimination Alan Hutchinson King's College London (revised) 19 December 1995 Keywords Predicate logic, Lambda calculus, Constructive logic |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr96-01.ps.gz, 19960111
A Formalisation of Semantic Schema Integration Peter Mc.Brien and Alex Poulovassilis Dept. of Computer Science King's College London Strand, London WC2R 2LS alex,pjm@dcs.kcl.ac.uk Thursday 23 rd November 1995 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr96-02.ps.gz, 19960220
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees Gautam Dasy Sanjiv Kapoorz Michiel Smidx February 20, 1996 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr96-04.ps.gz, 19960305
Pseudo-Metrics on First Order Terms Alan Hutchinson 5 March 1996 When searching for a proof, it helps to be able to measure the proximity of any lemma to the goal. Also, when trying to invent a definition of a useful general concept, it might be useful if one could form clusters of descriptions of |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr96-03.ps.gz, 19960307
Efficient Algorithms for Counting and Reporting Pairwise Intersections between Convex Polygons Prosenjit Gupta y Ravi Janardanz Michiel Smidx March 1, 1996 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr96-07.ps.gz, 19960329
Improved data structures for predecessor queries in integer sets Rajeev Raman August 1995 (revised March 1996) |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr96-06.ps.gz, 19960329
Fast Algorithms for Shortest Paths and Sorting Rajeev Raman March 1996 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr96-05.ps.gz, 19960329
Sorting in Linear Time Arne Anderssony Torben Hagerupz Stefan Nilssony Rajeev Ramanx September 1, 1995 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr96-09.ps.gz, 19960501
Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths Danny Z. Chen Gautam Dasy Michiel Smidz April 22, 1996 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr96-08.ps.gz, 19960501
On the circumradius of acute point sets Michiel Smid April 19, 1996 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr96-11.ps.gz, 19960810
Pseudo-Metrics on Terms and Clauses Alan Hutchinson 8 August 1996 In the subject of machine learning, a "concept" is a description of a cluster of the concept's instances. In order to invent a new concept, one has to discover such a cluster. The necessary tool for clustering is a metric, or |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr96-12.ps.gz, 19960911
A technique for adding range restrictions to generalized searching problems Prosenjit Gupta Ravi Janardany Michiel Smidz August 30, 1996 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr97-01.ps.gz, 19970114
MetateM in Intensive Care M Reynolds1 Department of Computer Science King's College London January 14, 1997 |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr97-02.ps.gz, 19970130
A Method for Integrating Deductive Databases Lihui Xu and Alexandra Poulovassilis Department of Computer Science King's College London Strand, London WC2R 2LS flihui; alexg@dcs.kcl.ac.uk |
| ftp://ftp.dcs.kcl.ac.uk/pub/tech-reports/tr96-13.ps.gz, 19970429
A summary of shortest-paths results Rajeev Raman December 1996 |
