04974nam 22008175 450 99646528370331620230220154447.03-642-32241-710.1007/978-3-642-32241-9(CKB)3400000000085728(SSID)ssj0000745881(PQKBManifestationID)11411478(PQKBTitleCode)TC0000745881(PQKBWorkID)10859624(PQKB)10315127(DE-He213)978-3-642-32241-9(MiAaPQ)EBC3070282(PPN)16832136X(EXLCZ)99340000000008572820120813d2012 u| 0engurnn|008mamaatxtccrComputing and Combinatorics[electronic resource] 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings /edited by Joachim Gudmundsson, Julián Mestre, Taso Viglas1st ed. 2012.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2012.1 online resource (XIV, 606 p. 116 illus.) Theoretical Computer Science and General Issues,2512-2029 ;7434International conference proceedings.3-642-32240-9 Includes bibliographical references and author index.A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree -- A Simple D2-Sampling Based PTAS for k-Means and other Clustering Problems -- Speed Scaling for Maximum Lateness -- Induced Subgraph Isomorphism: Are Some Patterns Substantially -- Easier Than Others -- Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs -- Online Knapsack Problem with Removal Cost -- An Improved Exact Algorithm for TSP in Degree-4 Graphs -- Dynamic Programming for H-minor-free Graphs -- Restricted Max-Min Fair Allocations with Inclusion-Free Intervals -- An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks -- Towards Optimal and Expressive Kernelization for d-Hitting Set.-Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs -- A Local Algorithm for Finding Dense Bipartite-Like Subgraphs -- Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs -- On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property -- Rainbow Colouring of Split and Threshold -- Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Succinct Representations of Binary Trees for Range Minimum Queries.This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012. The 50 revised full papers presented were carefully reviewed and selected from 121 submissions. Topics  covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization.Theoretical Computer Science and General Issues,2512-2029 ;7434AlgorithmsComputer science—MathematicsDiscrete mathematicsComputer networksComputer scienceComputer graphicsArtificial intelligenceAlgorithmsDiscrete Mathematics in Computer ScienceComputer Communication NetworksTheory of ComputationComputer GraphicsArtificial IntelligenceAlgorithms.Computer science—Mathematics.Discrete mathematics.Computer networks.Computer science.Computer graphics.Artificial intelligence.Algorithms.Discrete Mathematics in Computer Science.Computer Communication Networks.Theory of Computation.Computer Graphics.Artificial Intelligence.005.1Gudmundsson Joachimedthttp://id.loc.gov/vocabulary/relators/edtMestre Juliánedthttp://id.loc.gov/vocabulary/relators/edtViglas Tasoedthttp://id.loc.gov/vocabulary/relators/edtCOCOON (Conference)BOOK996465283703316Computing and Combinatorics772278UNISA04609nam 22006975 450 991091719410332120260605211506.09781071641729(electronic bk.)10.1007/978-1-0716-4172-9(MiAaPQ)EBC31823020(Au-PeEL)EBL31823020(CKB)36951652000041(DE-He213)978-1-0716-4172-9(OCoLC)1478691842(EXLCZ)993695165200004120241207d2024 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierApplied Probability /by Kenneth Lange3rd ed. 2024.New York, NY :Springer US :Imprint: Springer,2024.1 online resource (608 pages)Springer Texts in Statistics,2197-4136Print version: Lange, Kenneth Applied Probability New York, NY : Springer,c2025 9781071641712 Basic Notions of Probability Theory -- Calculation of Expectations -- Convexity, Optimization, and Inequalities -- Combinatorics -- Combinatorial Optimization -- Poisson Processes -- Discrete-Time Markov Chains -- Continuous-Time Markov Chains -- Branching Processes -- Martingales -- Diffusion Processes -- Asymptotic Methods -- Numerical Methods -- Poisson Approximation -- Number Theory -- Entropy -- Appendix: Mathematical Review.Applied Probability presents a unique blend of theory and applications, with special emphasis on mathematical modeling, computational techniques, and examples from the biological sciences. Chapter 1 reviews elementary probability and provides a brief survey of relevant results from measure theory. Chapter 2 is an extended essay on calculating expectations. Chapter 3 deals with probabilistic applications of convexity, inequalities, and optimization theory. Chapters 4 and 5 touch on combinatorics and combinatorial optimization. Chapters 6 through 11 present core material on stochastic processes. If supplemented with appropriate sections from Chapters 1 and 2, there is sufficient material for a traditional semester-long course in stochastic processes covering the basics of Poisson processes, Markov chains, branching processes, martingales, and diffusion processes. This third edition includes new topics and many worked exercises. The new chapter on entropy stresses Shannon entropy and its mathematical applications. New sections in existing chapters explain the Chinese restaurant problem, the infinite alleles model, saddlepoint approximations, and recurrence relations. The extensive list of new problems pursues topics such as random graph theory omitted in the previous editions. Computational probability receives even greater emphasis than earlier. Some of the solved problems are coding exercises, and Julia code is provided. Mathematical scientists from a variety of backgrounds will find Applied Probability appealing as a reference. This updated edition can serve as a textbook for graduate students in applied mathematics, biostatistics, computational biology, computer science, physics, and statistics. Readers should have a working knowledge of multivariate calculus, linear algebra, ordinary differential equations, and elementary probability theory.Springer Texts in Statistics,2197-4136StatisticsProbabilitiesComputer scienceMathematicsMathematical statisticsMathematicsData processingEstadística matemàticathubMatemàtica aplicadathubStatistical Theory and MethodsProbability TheoryProbability and Statistics in Computer ScienceComputational Mathematics and Numerical AnalysisLlibres electrònicsthubStatistics.Probabilities.Computer scienceMathematics.Mathematical statistics.MathematicsData processing.Estadística matemàticaMatemàtica aplicadaStatistical Theory and Methods.Probability Theory.Probability and Statistics in Computer Science.Computational Mathematics and Numerical Analysis.519.2Lange Kenneth59343MiAaPQMiAaPQMiAaPQ9910917194103321Applied probability1427051UNINA