{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":25,"n_cols":5,"rows_kept":25,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[18,2,18,3],[19,2,19,3],[23,2,23,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466021703316"]
[null,null,"Titolo",null,"Algorithmic Learning Theory [[electronic resource] ] : 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings / / edited by José L. Balcázar, Philip M. Long, Frank Stephan"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006"]
[null,null,"ISBN",null,"3-540-46650-9"]
[null,null,"Edizione",null,"[1st ed. 2006.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIII, 393 p.)"]
[null,null,"Collana",null,"Lecture Notes in Artificial Intelligence ; ; 4264"]
[null,null,"Disciplina",null,"006.31"]
[null,null,"Soggetti",null,"Artificial intelligence"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Mathematical logic"]
[{"$nulls":4},"Natural language processing (Computer science)"]
[{"$nulls":4},"Artificial Intelligence"]
[{"$nulls":4},"Computation by Abstract Devices"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[{"$nulls":4},"Natural Language Processing (NLP)"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Editors’ Introduction -- Editors’ Introduction -- Invited Contributions -- Solving Semi-infinite Linear Programs Using Boosting-Like Methods -- e-Science and the Semantic Web: A Symbiotic Relationship -- Spectral Norm in Learning Theory: Some Selected Topics -- Data-Driven Discovery Using Probabilistic Hidden Variable Models -- Reinforcement Learning and Apprenticeship Learning for Robotic Control -- Regular Contributions -- Learning Unions of ?(1)-Dimensional Rectangles -- On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle -- Active Learning in the Non-realizable Case -- How Many Query Superpositions Are Needed to Learn? -- Teaching Memoryless Randomized Learners Without Feedback -- The Complexity of Learning SUBSEQ (A) -- Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data "]
[{"$nulls":4},"-- Learning and Extending Sublanguages -- Iterative Learning from Positive Data and Negative Counterexamples -- Towards a Better Understanding of Incremental Learning -- On Exact Learning from Random Walk -- Risk-Sensitive Online Learning -- Leading Strategies in Competitive On-Line Prediction -- Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring -- General Discounting Versus Average Reward -- The Missing Consistency Theorem for Bayesian Learning: Stochastic Model Selection -- Is There an Elegant Universal Theory of Prediction? -- Learning Linearly Separable Languages -- Smooth Boosting Using an Information-Based Criterion -- Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice -- Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence -- Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning -- Unsupervised Slow Subspace-Learning from Stationary Processes -- Learning-Related Complexity of Linear Ranking Functions."]