Deakin University
Browse

File(s) under permanent embargo

Compute inclusion depth of a pattern

conference contribution
posted on 2005-01-01, 00:00 authored by Wei LuoWei Luo
We define a concept of inclusion depth (see Definition 1) to capture mind-change complexity [3,1] of pattern identification problems [2]. Our basic question is whether the inclusion depth for any pattern is computable. We conjecture a combinatorial characterization that, if true, leads to a linear time algorithm to compute inclusion depth.

History

Event

Conference on Computational Learning Theory (18th : 2005 : Bertinoro, Italy)

Pagination

689 - 690

Publisher

Springer

Location

Bertinoro, Italy

Place of publication

Berlin, Germany

Start date

2005-06-27

End date

2005-06-30

ISBN-13

9783540265566

ISBN-10

3540265562

Language

eng

Publication classification

E1.1 Full written paper - refereed

Copyright notice

2005, Springer

Editor/Contributor(s)

P Auer, R Meir

Title of proceedings

Learning Theory : 18th annual conference on learning theory, COLT 2005 Bertinoro, Italy June 27-30, 2005 : proceedings

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports