𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of learning strings and sequences

✍ Scribed by Tao Jiang; Ming Li

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
587 KB
Volume
119
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Complexity and the β€œLearning organizatio
Complexity and the β€œLearning organization”
✍ Ted Lumley πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 105 KB πŸ‘ 1 views

Ted Lumley's background is in the technologies of petroleum exploration and producing, with a focus on how information and knowledge flows catalyze teamwork. Since retiring in 1996 from his job as

Improved Bounds on the Sample Complexity
Improved Bounds on the Sample Complexity of Learning
✍ Yi Li; Philip M. Long; Aravind Srinivasan πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 137 KB

We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimates is measured using a variant of the relative error proposed by Haussler and Pollard. We also show that our bound is wit

On the complexity of string folding
On the complexity of string folding
✍ Mike Paterson; Teresa Przytycka πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 1001 KB

A fold of a finite string S over a given alphabet is an embedding of S in some fixed infinite grid, such as the square or cubic mesh. The score of a fold is the number of pairs of matching string symbols which are embedded at adjacent grid vertices. Folds of strings in two-and threedimensional meshe