File(s) under permanent embargo
Compute inclusion depth of a pattern
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 - 690Publisher
SpringerLocation
Bertinoro, ItalyPlace of publication
Berlin, GermanyPublisher DOI
Start date
2005-06-27End date
2005-06-30ISBN-13
9783540265566ISBN-10
3540265562Language
engPublication classification
E1.1 Full written paper - refereedCopyright notice
2005, SpringerEditor/Contributor(s)
P Auer, R MeirTitle of proceedings
Learning Theory : 18th annual conference on learning theory, COLT 2005 Bertinoro, Italy June 27-30, 2005 : proceedingsUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC