Arun Sharma

Orcid: 0000-0002-5794-733X

Affiliations:
  • Queensland University of Technology, Brisbane, Australia
  • University of New South Wales, School of Computer Science and Engineering, Sydney, Australia


According to our database1, Arun Sharma authored at least 60 papers between 1989 and 2007.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2007
Deduction, Induction, and beyond in Parametric Logic.
Proceedings of the Induction, Algorithmic Learning Theory, and Philosophy, 2007

On the data consumption benefits of accepting increased uncertainty.
Theor. Comput. Sci., 2007

2006
On ordinal VC-dimension and some notions of complexity.
Theor. Comput. Sci., 2006

Unifying logic, topology and learning in Parametric logic.
Theor. Comput. Sci., 2006

Identifying Clusters from Positive Data.
SIAM J. Comput., 2006

2005
On a Syntactic Characterization of Classification with a Mind Change Bound.
Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

2004
Some applications of logic to feasibility in higher types.
ACM Trans. Comput. Log., 2004

Generalized notions of mind change complexity.
Inf. Comput., 2004

On the classification of recursive languages.
Inf. Comput., 2004

Web Searching and S 2 Queries.
Proceedings of the Advanced Web Technologies and Applications, 2004

2003
Learning power and language expressiveness.
Theor. Comput. Sci., 2003

2002
Preface
Theor. Comput. Sci., 2002

Mind change complexity of learning logic programs.
Theor. Comput. Sci., 2002

Learning to Win Process-Control Games Watching Game-Masters.
Inf. Comput., 2002

Learning in Logic with RichProlog.
Proceedings of the Logic Programming, 18th International Conference, 2002

Learning, Logic, and Topology in a Common Framework.
Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

2001
Synthesizing noise-tolerant language learners.
Theor. Comput. Sci., 2001

Predictive learning models for concept drift.
Theor. Comput. Sci., 2001

On a Generalized Notion of Mistake Bounds.
Inf. Comput., 2001

A General Theory of Deduction, Induction, and Learning.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

2000
Team Learning of Computable Languages.
Theory Comput. Syst., 2000

Robust Learning Aided by Context.
J. Comput. Syst. Sci., 2000

1999
Ordinal Mind Change Complexity of Language Identification.
Theor. Comput. Sci., 1999

On Sufficient Conditions for Learnability of Logic Programs from Positive Data.
Proceedings of the Inductive Logic Programming, 9th International Workshop, 1999

The VC-Dimension of Subclasses of Pattern.
Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999

1998
A Note on Batch and Incremental Learnability.
J. Comput. Syst. Sci., 1998

Generalization and Specialization Strategies for Learning r.e. Languages.
Ann. Math. Artif. Intell., 1998

LIME: A System for Learning Relations.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997
Learning from Multiple Sources of Inaccurate Data.
SIAM J. Comput., 1997

The Structure of Intrinsic Complexity of Learning.
J. Symb. Log., 1997

Elementary Formal Systems, Intrinsic Complexity, and Procrastination.
Inf. Comput., 1997

Characterizing Language Identification in Terms of Computable Numberings.
Ann. Pure Appl. Log., 1997

On the Classification of Computable Languages.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

ILP with Noise and Fixed Example Size: A Bayesian Approach.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

1996
Anomalous Learning Helps Succinctness.
Theor. Comput. Sci., 1996

The Intrinsic Complexity of Language Identification.
J. Comput. Syst. Sci., 1996

Computational Limits on Team Identification of Languages.
Inf. Comput., 1996

Machine Induction Without Revolutionary Changes in Hypothesis Size.
Inf. Comput., 1996

Team Learning of Recursive Languages.
Proceedings of the PRICAI'96: Topics in Artificial Intelligence, 1996

1995
Finite Identification of Functions by Teams with Success Ratio 1\over2 and Above
Inf. Comput., September, 1995

Complexity Issues for Vacillatory Function Identification
Inf. Comput., February, 1995

On Aggregating Teams of Learning Machines.
Theor. Comput. Sci., 1995

Prudence in Vacillatory Language Identification.
Math. Syst. Theory, 1995

On Identification by Teams and Probabilistic Machines.
Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Machine Induction Without Revolutionary Paradigm Shifts.
Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994
Program Size Restrictions in Computational Learning.
Theor. Comput. Sci., 1994

Characterizing Language Identification by Standardizing Operations.
J. Comput. Syst. Sci., 1994

Vacillatory Learning of Nearly Minimal Size Grammars.
J. Comput. Syst. Sci., 1994

On Monotonic Strategies for Learning r.e. Languages.
Proceedings of the Algorithmic Learning Theory, 1994

1993
Learning with the Knowledge of an Upper Bound on Program Size
Inf. Comput., January, 1993

On the Non-Existence of Maximal Inference Degrees for Language Identification.
Inf. Process. Lett., 1993

Probability is More Powerful Than Team for Language Identification from Positive Data.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992
On Learning Limiting Programs.
Int. J. Found. Comput. Sci., 1992

Prudence in Vacillatory Language Identification (Extended Abstract).
Proceedings of the Algorithmic Learning Theory, Third Workshop, 1992

1991
Learning in the Presence of Partial Explanations
Inf. Comput., December, 1991

1990
Hypothesis Formation and Language Acquisition with an Infinitely-Often Correct Teacher.
Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge, 1990

Language Learning by a "Team" (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Finite Learning by a "Team".
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

Anomalous Learning Helps Succinctness (Extended Abstract).
Proceedings of the Algorithmic Learning Theory, First International Workshop, 1990

1989
Convergence to Nearly Minimal Size Grammars by Vacillating Learning Machines.
Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989


  Loading...