LEADER 00835nam a2200229 i 4500 001 991002792509707536 005 20020508210053.0 008 000207s1983 it ||| | ita 035 $ab1106111x-39ule_inst 035 $aPARLA169118$9ExL 040 $aDip.to Scienze dell'Antichitā$bita 100 1 $aOrlandi, Tito$0161565 245 10$aElementi di grammatica copto-saidica /$cTito Orlandi 260 $aRoma :$bC.I.M.,$c1983 300 $a56 p. ;$c24 cm. 490 0 $aCorpus dei manoscritti copti letterari 907 $a.b1106111x$b23-02-17$c28-06-02 912 $a991002792509707536 945 $aLE015 491 - 2$g1$i2015000045508$lle007$o-$pE0.00$q-$rl$s- $t0$u1$v1$w1$x0$y.i11187359$z28-06-02 996 $aElementi di grammatica copto-saidica$9859866 997 $aUNISALENTO 998 $ale007$b01-01-00$cm$da $e-$fita$git $h0$i1 LEADER 06360nam 22007935 450 001 9910144028803321 005 20251223183944.0 010 $a3-540-39624-1 024 7 $a10.1007/b14273 035 $a(CKB)1000000000212225 035 $a(SSID)ssj0000321175 035 $a(PQKBManifestationID)11247372 035 $a(PQKBTitleCode)TC0000321175 035 $a(PQKBWorkID)10263622 035 $a(PQKB)10983029 035 $a(DE-He213)978-3-540-39624-6 035 $a(MiAaPQ)EBC3087723 035 $a(PPN)155202111 035 $a(BIP)9066499 035 $a(EXLCZ)991000000000212225 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithmic Learning Theory $e14th International Conference, ALT 2003, Sapporo, Japan, October 17-19, 2003, Proceedings /$fedited by Ricard Gavaldā, Klaus P. Jantke, Eiji Takimoto 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XII, 320 p.) 225 1 $aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v2842 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-20291-9 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Papers -- Abduction and the Dualization Problem -- Signal Extraction and Knowledge Discovery Based on Statistical Modeling -- Association Computation for Information Access -- Efficient Data Representations That Preserve Information -- Can Learning in the Limit Be Done Efficiently? -- Inductive Inference -- Intrinsic Complexity of Uniform Learning -- On Ordinal VC-Dimension and Some Notions of Complexity -- Learning of Erasing Primitive Formal Systems from Positive Examples -- Changing the Inference Type ? Keeping the Hypothesis Space -- Learning and Information Extraction -- Robust Inference of Relevant Attributes -- Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables -- Learning with Queries -- On the Learnability of Erasing Pattern Languages in the Query Model -- Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries -- Learning with Non-linear Optimization -- Kernel Trick Embedded Gaussian Mixture Model -- Efficiently Learning the Metric with Side-Information -- Learning Continuous Latent Variable Models with Bregman Divergences -- A Stochastic Gradient Descent Algorithm for Structural Risk Minimisation -- Learning from Random Examples -- On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays -- Learning a Subclass of Regular Patterns in Polynomial Time -- Identification with Probability One of Stochastic Deterministic Linear Languages -- Online Prediction -- Criterion of Calibration for Transductive Confidence Machine with Limited Feedback -- Well-Calibrated Predictions from Online Compression Models -- Transductive Confidence Machine Is Universal -- On the Existence and Convergence of Computable Universal Priors. 330 $aThis volume contains the papers presented at the 14th Annual Conference on Algorithmic Learning Theory (ALT 2003), which was held in Sapporo (Japan) duringOctober17-19,2003. Themainobjectiveoftheconferencewastoprovide an interdisciplinary forum for discussing the theoretical foundations of machine learning as well as their relevance to practical applications. The conference was co-locatedwiththe6thInternationalConferenceonDiscoveryScience(DS2003). The volume includes 19 technical contributions that were selected by the program committee from 37 submissions. It also contains the ALT 2003 invited talks presented by Naftali Tishby (Hebrew University, Israel) on "E'cient Data Representations that Preserve Information," by Thomas Zeugmann (University of Lub ¨ eck, Germany) on "Can Learning in the Limit be Done E'ciently?", and by Genshiro Kitagawa (Institute of Statistical Mathematics, Japan) on "S- nal Extraction and Knowledge Discovery Based on Statistical Modeling" (joint invited talk with DS 2003). Furthermore, this volume includes abstracts of the invitedtalksforDS2003presentedbyThomasEiter(ViennaUniversityofTe- nology, Austria) on "Abduction and the Dualization Problem" and by Akihiko Takano (National Institute of Informatics, Japan) on "Association Computation for Information Access. " The complete versions of these papers were published in the DS 2003 proceedings (Lecture Notes in Arti'cial Intelligence Vol. 2843). ALT has been awarding theE. MarkGoldAward for the most outstanding paper by a student author since 1999. This year the award was given to Sandra Zilles for her paper "Intrinsic Complexity of Uniform Learning. " This conference was the 14th in a series of annual conferences established in 1990. ContinuationoftheALTseriesissupervisedbyitssteeringcommittee,c- sisting of: Thomas Zeugmann (Univ. 410 0$aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v2842 606 $aArtificial intelligence 606 $aComputer science 606 $aAlgorithms 606 $aMachine theory 606 $aNatural language processing (Computer science) 606 $aArtificial Intelligence 606 $aTheory of Computation 606 $aAlgorithms 606 $aFormal Languages and Automata Theory 606 $aNatural Language Processing (NLP) 615 0$aArtificial intelligence. 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aMachine theory. 615 0$aNatural language processing (Computer science). 615 14$aArtificial Intelligence. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aFormal Languages and Automata Theory. 615 24$aNatural Language Processing (NLP). 676 $a006.3/1 702 $aGavaldā$b Ricard$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJantke$b Klaus P$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aTakimoto$b Eiji$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aALT 2003 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144028803321 996 $aAlgorithmic Learning Theory$9771965 997 $aUNINA