Joseph Douglas Horton

According to our database, Joseph Douglas Horton authored at least 35 papers between 1971 and 2014.

Collaborative distances:

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

2014

An Algorithm for Quantum Template Matching.

Md. Mazder Rahman, Gerhard W. Dueck, Joseph D. Horton

ACM J. Emerg. Technol. Comput. Syst., 2014

2013

Conditioning on Disjunctive Knowledge: Defaults and Probabilities

Eric Neufeld, Joseph Douglas Horton

CoRR, 2013

A Long Term Proposal to Simulate Consciousness in Artificial Life.

Joseph D. Horton, Michael Francis, Eckart Sußenburger

Proceedings of the ICAART 2013, 2013

2011

Assigning routes and wavelengths for collaboration over optical networks.

Yosri Harzallah, Joseph D. Horton, Bruce Spencer

Photonic Netw. Commun., 2011

2010

A Near-Linear Time Algorithm for Haplotype Determination on General Pedigrees.

Duong Dai Doan, Patricia A. Evans, Joseph D. Horton

J. Comput. Biol., 2010

2005

Minimum cycle bases of graphs over different fields.

Joseph D. Horton, Franziska Berger

Electron. Notes Discret. Math., 2005

Cross-Stitching Using Little Thread.

Therese C. Biedl, Joseph Douglas Horton, Alejandro López-Ortiz

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2003

On the number of distributed measurement points for network tomography.

Joseph Douglas Horton, Alejandro López-Ortiz

Proceedings of the 3rd ACM SIGCOMM Internet Measurement Conference, 2003

Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting.

Therese C. Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper

Proceedings of the Algorithms, 2003

2002

Factoring the cartesian product of a cubic graph and a triangle.

Joseph Douglas Horton, Walter D. Wallis

Discret. Math., 2002

A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid.

Alexander Golynski, Joseph Douglas Horton

Proceedings of the Algorithm Theory, 2002

Searching for the center of a circle.

Therese C. Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

Counting the Number of Equivalent Binary Resolution Proofs.

Joseph D. Horton

Proceedings of the Logic for Programming, 2001

2000

Efficient Algorithms to Detect and Restore Minimality, an Extension of the Regular Restriction of Resolution.

Bruce Spencer, Joseph Douglas Horton

J. Autom. Reason., 2000

Support Ordered Resolution.

Bruce Spencer, Joseph Douglas Horton

Proceedings of the Automated Deduction, 2000

1999

Merge Path Improvements for Minimal Model Hyper Tableaux.

Peter Baumgartner, Joseph Douglas Horton, Bruce Spencer

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1999

1998

Rank/Activity: A Canonical Form for Binary Resolution.

Joseph Douglas Horton, Bruce Spencer

Proceedings of the Automated Deduction, 1998

1997

Clause Trees: A Tool for Understanding and Implementing Resolution in Automated Reasoning.

Joseph Douglas Horton, Bruce Spencer

Artif. Intell., 1997

Dynamizing domination queries in 2-dimensions: The paper stabbing problem revisited.

Michael G. Lamoureux, Joseph Douglas Horton, Bradford G. Nickerson

Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

Extending the Regular Restriction of Resolution to Non-Linear Subdeductions.

Bruce Spencer, Joseph Douglas Horton

Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1993

Minimum Edge Dominating Sets.

Joseph Douglas Horton, Kyriakos Kilakos

SIAM J. Discret. Math., 1993

The Cascade Vulnerability Problem.

Joseph Douglas Horton, Rodney H. Cooper, W. F. Hyslop, Bradford G. Nickerson, O. K. Ward, Robert Harland, Elton Ashby, W. M. Stewart

J. Comput. Secur., 1993

1991

Symmetric <i>Y</i>-graphs and <i>H</i>-graphs.

Joseph Douglas Horton, I. Z. Bouwer

J. Comb. Theory, Ser. B, 1991

Self-orthogonal Hamilton path decompositions.

Joseph Douglas Horton, Gillian M. Nonay

Discret. Math., 1991

A hyperfactorization of order 8, index 2.

Joseph Douglas Horton

Discret. Math., 1991

1990

Orthogonal starters in finite abelian groups.

Joseph Douglas Horton

Discret. Math., 1990

1989

Conditioning on Disjunctive Knowledge: Simpson's Paradox in Default Logic.

Eric Neufeld, Joseph Douglas Horton

Proceedings of the UAI '89: Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence, 1989

1987

A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph.

Joseph Douglas Horton

SIAM J. Comput., 1987

1985

Resolvable Path Designs.

Joseph Douglas Horton

J. Comb. Theory, Ser. A, 1985

1983

Non-hamiltonian 3-connected cubic bipartite graphs.

Mark N. Ellingham, Joseph Douglas Horton

J. Comb. Theory, Ser. B, 1983

The construction of Kotzig factorizations.

Joseph Douglas Horton

Discret. Math., 1983

1982

On two-factors of bipartite regular graphs.

Joseph Douglas Horton

Discret. Math., 1982

1974

Sub-Latin Squares and Incomplete Orthogonal Arrays.

Joseph Douglas Horton

J. Comb. Theory, Ser. A, 1974

1972

A Multiplication Theorem for Room Squares.

R. G. Stanton, Joseph Douglas Horton

J. Comb. Theory, Ser. A, 1972

1971

On Covering Sets and Error-Correcting Codes.

J. G. Kalbfleisch, R. G. Stanton, Joseph Douglas Horton

J. Comb. Theory, Ser. A, 1971