Thomas W. Kelsey

Orcid: 0000-0002-8091-1458

Affiliations:
  • University of St Andrews, UK


According to our database1, Thomas W. Kelsey authored at least 29 papers between 1998 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Efficient identification of patients eligible for clinical studies using case-based reasoning on Scottish Health Research register (SHARE).
BMC Medical Informatics Decis. Mak., 2020

2019
Representation learning for minority and subtle activities in a smart home environment.
J. Ambient Intell. Smart Environ., 2019

Representation Learning for Minority and Subtle Activities in a Smart Home Environment.
Proceedings of the 2019 IEEE International Conference on Pervasive Computing and Communications, 2019

2014
Qualitative modelling via constraint programming.
Constraints An Int. J., 2014

Web-Scale Distributed eScience AI Search across Disconnected and Heterogeneous Infrastructures.
Proceedings of the 10th IEEE International Conference on e-Science, 2014

2013
Ovarian volume throughout life: a validated normative model
CoRR, 2013

2012
Qualitative Modelling via Constraint Programming: Past, Present and Future
CoRR, 2012

A framework for large-scale distributed AI search across disconnected heterogeneous infrastructures
CoRR, 2012

The Semigroups of Order 10.
Proceedings of the Principles and Practice of Constraint Programming, 2012

2011
Exact Closest String as a Constraint Satisfaction Problem.
Proceedings of the International Conference on Computational Science, 2011

2010
Proliferating cell nuclear antigen (PCNA) allows the automatic identification of follicles in microscopic images of human ovarian tissue
CoRR, 2010

The Exact Closest String Problem as a Constraint Satisfaction Problem
CoRR, 2010

Machine science in biomedicine: Practicalities, pitfalls and potential.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2010

2009
The monoids of orders eight, nine & ten.
Ann. Math. Artif. Intell., 2009

Towards the Calculation of Casimir Forces for Inhomogeneous Planar Media.
Proceedings of the Computer Mathematics, 2009

2008
The Monoids of Order Eight and Nine.
Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

2007
Search in the patience game 'Black Hole'.
AI Commun., 2007

Groupoids and Conditional Symmetry.
Proceedings of the Principles and Practice of Constraint Programming, 2007

2005
Hidden verification for computational mathematics.
J. Symb. Comput., 2005

Symmetry and Consistency.
Proceedings of the Principles and Practice of Constraint Programming, 2005

Conditional Symmetry Breaking.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
Design Verification for Control Engineering.
Proceedings of the Integrated Formal Methods, 4th International Conference, 2004

Tractable Symmetry Breaking Using Restricted Search Trees.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

New Developments in Symmetry Breaking in Search Using Computational Group Theory.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2004

2003
Generic SBDD Using Computational Group Theory.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
Groups and Constraints: Symmetry Breaking during Search.
Proceedings of the Principles and Practice of Constraint Programming, 2002

2001
Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS.
Proceedings of the Theorem Proving in Higher Order Logics, 14th International Conference, 2001

1999
Formal Methods for Extensions to CAS.
Proceedings of the FM'99 - Formal Methods, 1999

1998
Lightweight Formal Methods for Computer Algebra Systems.
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998


  Loading...