Páidí Creed

According to our database, Páidí Creed authored at least 15 papers between 2004 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Neural-signature methods for structured EHR prediction.

Andre Vauvelle, Páidí Creed, Spiros C. Denaxas

BMC Medical Informatics Decis. Mak., December, 2022

Contrastive Mixture of Posteriors for Counterfactual Inference, Data Integration and Fairness.

Adam Foster, Árpi Vezér, Craig A. Glastonbury, Páidí Creed, Samer Abujudeh, Aaron Sim

Proceedings of the International Conference on Machine Learning, 2022

2021

Directed Graph Embeddings in Pseudo-Riemannian Manifolds.

Aaron Sim, Maciej Wiatrak, Angus Brayne, Páidí Creed, Saee Paliwal

Proceedings of the 38th International Conference on Machine Learning, 2021

2018

Interpretable Graph Convolutional Neural Networks for Inference on Noisy Knowledge Graphs.

Daniel Neil, Joss Briody, Alix Lacoste, Aaron Sim, Páidí Creed, Amir Saffari

CoRR, 2018

2013

An Algebraic Theory of Complexity for Discrete Optimization.

David A. Cohen, Martin C. Cooper, Páidí Creed, Peter G. Jeavons, Stanislav Zivný

SIAM J. Comput., 2013

The Number of Euler Tours of Random Directed Graphs.

Páidí Creed, Mary Cryan

Electron. J. Comb., 2013

2012

The Tractability of CSP Classes Defined by Forbidden Patterns.

David A. Cohen, Martin C. Cooper, Páidí Creed, Dániel Marx, András Z. Salamon

J. Artif. Intell. Res., 2012

An Algebraic Theory of Complexity for Discrete Optimisation

David A. Cohen, Martin C. Cooper, Páidí Creed, Peter G. Jeavons, Stanislav Zivný

CoRR, 2012

The number of Euler tours of a random directed graph

Páidí Creed, Mary Cryan

CoRR, 2012

2011

The tractability of CSP classes defined by forbidden patterns

David A. Cohen, Martin C. Cooper, Páidí Creed, András Z. Salamon

CoRR, 2011

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection.

David A. Cohen, Páidí Creed, Peter G. Jeavons, Stanislav Zivný

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

On Minimal Weighted Clones.

Páidí Creed, Stanislav Zivný

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2009

Sampling Eulerian orientations of triangular lattice graphs.

Páidí J. Creed

J. Discrete Algorithms, 2009

2006

Sampling Eulerian Orientations of the Triangle.

Páidí J. Creed

Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2004

Adversarial Constraint Satisfaction by Game-Tree Search.

Kenneth N. Brown, James Little, Páidí J. Creed, Eugene C. Freuder

Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004