00811nam0-2200277 --450 991027135860332120180613113607.0978-0-19-533787-720180613d2014----kmuy0itay5050 baengGB 001yy<<The >>Indian Ocean in world historyEdward A. AlpersOxfordOxford University pressc2014X, 172 p.ill.24 cm.<<The >>new Oxford world historyOCEANO INDIANOStoria909.0982423itaAlpers,Edward A.242775ITUNINAREICATUNIMARCBK9910271358603321XIV E 4369744/2018FSPBCFSPBCIndian Ocean in world history1505745UNINA05776nam 22006855 450 99646580720331620200629201012.03-540-27819-210.1007/b98522(CKB)1000000000210170(SSID)ssj0000190641(PQKBManifestationID)11215644(PQKBTitleCode)TC0000190641(PQKBWorkID)10180719(PQKB)11723536(DE-He213)978-3-540-27819-1(MiAaPQ)EBC3088488(PPN)155179225(EXLCZ)99100000000021017020121227d2004 u| 0engurnn|008mamaatxtccrLearning Theory[electronic resource] 17th Annual Conference on Learning Theory, COLT 2004, Banff, Canada, July 1-4, 2004, Proceedings /edited by John Shawe-Taylor, Yoram Singer1st ed. 2004.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2004.1 online resource (X, 654 p.) Lecture Notes in Artificial Intelligence ;3120Includes index.3-540-22282-0 Economics and Game Theory -- Towards a Characterization of Polynomial Preference Elicitation with Value Queries in Combinatorial Auctions -- Graphical Economics -- Deterministic Calibration and Nash Equilibrium -- Reinforcement Learning for Average Reward Zero-Sum Games -- OnLine Learning -- Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability -- Minimizing Regret with Label Efficient Prediction -- Regret Bounds for Hierarchical Classification with Linear-Threshold Functions -- Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary -- Inductive Inference -- Learning Classes of Probabilistic Automata -- On the Learnability of E-pattern Languages over Small Alphabets -- Replacing Limit Learners with Equally Powerful One-Shot Query Learners -- Probabilistic Models -- Concentration Bounds for Unigrams Language Model -- Inferring Mixtures of Markov Chains -- Boolean Function Learning -- PExact = Exact Learning -- Learning a Hidden Graph Using O(log n) Queries Per Edge -- Toward Attribute Efficient Learning of Decision Lists and Parities -- Empirical Processes -- Learning Over Compact Metric Spaces -- A Function Representation for Learning in Banach Spaces -- Local Complexities for Empirical Risk Minimization -- Model Selection by Bootstrap Penalization for Classification -- MDL -- Convergence of Discrete MDL for Sequential Prediction -- On the Convergence of MDL Density Estimation -- Suboptimal Behavior of Bayes and MDL in Classification Under Misspecification -- Generalisation I -- Learning Intersections of Halfspaces with a Margin -- A General Convergence Theorem for the Decomposition Method -- Generalisation II -- Oracle Bounds and Exact Algorithm for Dyadic Classification Trees -- An Improved VC Dimension Bound for Sparse Polynomials -- A New PAC Bound for Intersection-Closed Concept Classes -- Clustering and Distributed Learning -- A Framework for Statistical Clustering with a Constant Time Approximation Algorithms for K-Median Clustering -- Data Dependent Risk Bounds for Hierarchical Mixture of Experts Classifiers -- Consistency in Models for Communication Constrained Distributed Learning -- On the Convergence of Spectral Clustering on Random Samples: The Normalized Case -- Boosting -- Performance Guarantees for Regularized Maximum Entropy Density Estimation -- Learning Monotonic Linear Functions -- Boosting Based on a Smooth Margin -- Kernels and Probabilities -- Bayesian Networks and Inner Product Spaces -- An Inequality for Nearly Log-Concave Distributions with Applications to Learning -- Bayes and Tukey Meet at the Center Point -- Sparseness Versus Estimating Conditional Probabilities: Some Asymptotic Results -- Kernels and Kernel Matrices -- A Statistical Mechanics Analysis of Gram Matrix Eigenvalue Spectra -- Statistical Properties of Kernel Principal Component Analysis -- Kernelizing Sorting, Permutation, and Alignment for Minimum Volume PCA -- Regularization and Semi-supervised Learning on Large Graphs -- Open Problems -- Perceptron-Like Performance for Intersections of Halfspaces -- The Optimal PAC Algorithm -- The Budgeted Multi-armed Bandit Problem.Lecture Notes in Artificial Intelligence ;3120Artificial intelligenceMathematical logicAlgorithmsComputersArtificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Artificial intelligence.Mathematical logic.Algorithms.Computers.Artificial Intelligence.Mathematical Logic and Formal Languages.Algorithm Analysis and Problem Complexity.Computation by Abstract Devices.006.31Shawe-Taylor Johnedthttp://id.loc.gov/vocabulary/relators/edtSinger Yoramedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK996465807203316Learning Theory772233UNISA03226oam 2200673I 450 991078538310332120200520144314.01-136-89988-X1-136-89989-81-282-89849-397866128984950-203-84160-310.4324/9780203841600 (CKB)2670000000052513(EBL)592909(OCoLC)680017924(SSID)ssj0000426439(PQKBManifestationID)11294782(PQKBTitleCode)TC0000426439(PQKBWorkID)10372889(PQKB)11049586(Au-PeEL)EBL592909(CaPaEBR)ebr10428039(CaONFJC)MIL289849(MiAaPQ)EBC592909(PPN)19845046X(EXLCZ)99267000000005251320180706d2011 uy 0engur|n|---|||||txtccrPublic management and complexity theory richer decision-making in public services /by Mary Lee Rhodes. [et al.]First edition.New York :Routledge,2011.1 online resource (250 p.)Routledge critical studies in public management ;6Description based upon print version of record.0-415-65402-5 0-415-45753-X Includes bibliographical references and index.Book Cover; Title; Copyright; Contents; Figures; Tables; Abbreviations and Acronyms; Acknowledgements; Introduction: The Case for CAS; 1 Setting the Stage for a CAS Analysis; 2 Urban Regeneration in Ireland; 3 Healthcare Information Systems in Ireland; 4 Advancing the Case for Complex Adaptive Systems in Public Administration; 5 The Impact of Boundaries: Identity, Community and Place; 6 Vision and the Dynamics of Change; 7 The Role and Effect of the Private Sector; 8 Core and Locale: The Tension Between the GoverningIntent and the Implementing Outcome; 9 In Conclusion; Notes; BibliographyIndexThat public services exhibit unpredictability, novelty and, on occasion, chaos, is an observation with which even a casual observer would agree. Existing theoretical frameworks in public management fail to address these features, relying more heavily on attempts to eliminate unpredictability through increased reliance on measurable performance objectives, improved financial and human resource management techniques, decentralisation of authority and accountability and resolving principal-agent behaviour pathologies. Essentially, these are all attempts to improve the 'steering' capacity of pRoutledge critical studies in public management ;6.Public administrationIrelandCase studiesCivil serviceIrelandCase studiesPublic administrationCivil service352.3/3Rhodes Mary Lee1466464MiAaPQMiAaPQMiAaPQBOOK9910785383103321Public management and complexity theory3676954UNINA