Tom Bylander

According to our database1, Tom Bylander authored at least 45 papers between 1983 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Web Searching with Multiple Correct Answers.
Proceedings of the 4th International Conference on Web Intelligence, 2014

2012
Predicting website correctness from consensus analysis.
Proceedings of the Research in Applied Computation Symposium, 2012

2011
Numeric Query Answering on the Web.
Int. J. Semantic Web Inf. Syst., 2011

Learning Linear Functions with Quadratic and Linear Multiplicative Updates.
Proceedings of the 28th International Conference on Machine Learning, 2011

2010
Transforming examples for multiclass boosting.
J. Exp. Theor. Artif. Intell., 2010

2006
Predicting currency exchange rates by genetic programming with trigonometric functions and high-order statistics.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

Using Validation Sets to Avoid Overfitting in AdaBoost.
Proceedings of the Nineteenth International Florida Artificial Intelligence Research Society Conference, 2006

2002
Estimating Generalization Error on Two-Class Datasets Using Out-of-Bag Estimates.
Mach. Learn., 2002

1999
Estimating Generalization Error Using Out-of-Bag Estimates.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1998
Worst-Case Analysis of the Perceptron and Exponentiated Update Algorithms.
Artif. Intell., 1998

1997
A perceptron-like online algorithm for tracking the median.
Proceedings of International Conference on Neural Networks (ICNN'97), 1997

The Binary Exponentiated Gradient Algorithm for Learning Linear Functions.
Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

Learning Probabilistically Consistent Linear Threshold Functions.
Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

A Linear Programming Heuristic for Optimal Planning.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

Worst-Case Absolute Loss Bounds for Linear Learning Algorithms.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996
A Probabilistic Analysis of Propositional STRIPS Planning.
Artif. Intell., 1996

1995
Learning Linear Threshold Approximations Using Perceptrons.
Neural Comput., 1995

1994
The Computational Complexity of Propositional STRIPS Planning.
Artif. Intell., 1994

Learning Linear Threshold Functions in the Presence of Classification Noise.
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

1993
Polynomial Learnability of Linear Threshold Approximations.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

An Average Case Analysis of Planning.
Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

1992
Complexity Results for Serial Decomposability.
Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991
Tractability and artificial intelligence.
J. Exp. Theor. Artif. Intell., 1991

A Theory of Consolidation for Reasoning about Devices.
Int. J. Man Mach. Stud., 1991

Knowledge Compilation: A Symposium.
IEEE Expert, 1991

The Computational Complexity of Abduction.
Artif. Intell., 1991

The Monotonic Abduction Problem: A Functional Characterization on the Edge of Tractability.
Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'91). Cambridge, 1991

Complexity Results for Planning.
Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

Generating Error Candidates for Assigning Blame in a Knowledge Base.
Proceedings of the Eighth International Workshop (ML91), 1991

The Qualitative Difference Resolution Rule.
Proceedings of the 9th National Conference on Artificial Intelligence, 1991

1990
Some causal models are deeper than others.
Artif. Intell. Medicine, 1990

1989
Computational Feasibility of Structured Matching.
IEEE Trans. Pattern Anal. Mach. Intell., 1989

Using causal reasoning in gait analysis.
Appl. Artif. Intell., 1989

Some Results Concerning the Computational Complexity of Abduction.
Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89). Toronto, 1989

Structured matching: a task-specific technique for making decisions.
Proceedings of the IEEE International Workshop on Tools for Artificial Intelligence: Architectures, 1989

1988
A critique of qualitative simulation from a consolidation viewpoint.
IEEE Trans. Syst. Man Cybern., 1988

Theoretical Issues in Conceptual Information Processing.
AI Mag., 1988

1987
Distributed Expert-Based Information Systems: An Interdisciplinary Approach.
Inf. Process. Manag., 1987

Generic Tasks for Knowledge-Based Reasoning: The "Right" Level of Abstraction for Knowledge Acquisition.
Int. J. Man Mach. Stud., 1987

Computational Complexity of Hypothesis Assembly.
Proceedings of the 10th International Joint Conference on Artificial Intelligence. Milan, 1987

The Generic Task Toolset.
Proceedings of the Cognitive Engeineering in the Design of Human-Computer Interaction and Expert Systems, 1987

1986
CRSL: A Language for Classificatory Problem Solving and Uncertainty Handling.
AI Mag., 1986

1985
Artificial Intelligence Research at The Ohio State University.
AI Mag., 1985

Understanding Behavior Using Consolidation.
Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985

1983
CSRL: A Language for Expert Systems for Diagnosis.
Proceedings of the 8th International Joint Conference on Artificial Intelligence. Karlsruhe, 1983


  Loading...