John Howroyd

According to our database, John Howroyd authored at least 14 papers between 2001 and 2017.

Collaborative distances:

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

2017

Improving Record Linkage Accuracy with Hierarchical Feature Level Information and Parsed Data.

Yun Zhou, Minlue Wang, Valeriia Haberland, John Howroyd, Sebastian Danicic, J. Mark Bishop

New Gener. Comput., 2017

Entity Search/Match in Relational Databases.

Minlue Wang, Valeriia Haberland, Andrew O. Martin, John Howroyd, John Mark Bishop

Proceedings of the 9th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management, 2017

2016

A Probabilistic Address Parser Using Conditional Random Fields and Stochastic Regular Grammar.

Minlue Wang, Valeriia Haberland, Amos Yeo, Andrew O. Martin, John Howroyd, J. Mark Bishop

Proceedings of the IEEE International Conference on Data Mining Workshops, 2016

2015

Extending Naive Bayes Classifier with Hierarchy Feature Level Information for Record Linkage.

Yun Zhou, John Howroyd, Sebastian Danicic, J. Mark Bishop

Proceedings of the Advanced Methodologies for Bayesian Networks, 2015

2011

A unifying theory of control dependence and its application to arbitrary program structures.

Sebastian Danicic, Richard W. Barraclough, Mark Harman, John Howroyd, Ákos Kiss, Michael R. Laurence

Theor. Comput. Sci., 2011

2007

Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time.

Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence

Theor. Comput. Sci., 2007

A non-standard semantics for program slicing and dependence analysis.

Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya

J. Log. Algebraic Methods Program., 2007

2006

A formal relationship between program slicing and partial evaluation.

David W. Binkley, Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya

Formal Aspects Comput., 2006

2005

<i>ConSUS</i>: a light-weight program conditioner.

Sebastian Danicic, Mohammed Daoudi, Chris Fox, Mark Harman, Robert M. Hierons, John Howroyd, Lahcen Ouarbya, Martin P. Ward

J. Syst. Softw., 2005

Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas.

Sebastian Danicic, Chris Fox, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence

Comput. J., 2005

2003

Equivalence of conservative, free, linear program schemas is decidable.

Michael R. Laurence, Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd

Theor. Comput. Sci., 2003

2002

ConSUS: A Scalable Approach to Conditioned Slicing.

Mohammed Daoudi, Lahcen Ouarbya, John Howroyd, Sebastian Danicic, Mark Harman, Chris Fox, Martin P. Ward

Proceedings of the 9th Working Conference on Reverse Engineering (WCRE 2002), 28 October, 2002

2001

Node Coarsening Calculi for Program Slicing.

Mark Harman, Robert M. Hierons, Sebastian Danicic, John Howroyd, Michael R. Laurence, Chris Fox

Proceedings of the Eighth Working Conference on Reverse Engineering, 2001

Pre/Post Conditioned Slicing.

Mark Harman, Robert M. Hierons, Chris Fox, Sebastian Danicic, John Howroyd

Proceedings of the 2001 International Conference on Software Maintenance, 2001