05814nam 22006975 450 991048308700332120230406064256.03-540-39101-010.1007/11847250(CKB)1000000000283957(SSID)ssj0000319340(PQKBManifestationID)11265240(PQKBTitleCode)TC0000319340(PQKBWorkID)10354357(PQKB)10710016(DE-He213)978-3-540-39101-2(MiAaPQ)EBC3068259(PPN)123138000(EXLCZ)99100000000028395720100301d2006 u| 0engurnn#008mamaatxtccrParameterized and Exact Computation Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings /edited by Hans L. Bodlaender, Michael A. Langston1st ed. 2006.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2006.1 online resource (XI, 279 p.)Theoretical Computer Science and General Issues,2512-2029 ;4169Bibliographic Level Mode of Issuance: Monograph3-540-39098-7 Includes bibliographical references and index.Applying Modular Decomposition to Parameterized Bicluster Editing -- The Cluster Editing Problem: Implementations and Experiments -- The Parameterized Complexity of Maximality and Minimality Problems -- Parameterizing MAX SNP Problems Above Guaranteed Values -- Randomized Approximations of Parameterized Counting Problems -- Fixed-Parameter Complexity of Minimum Profile Problems -- On the OBDD Size for Graphs of Bounded Tree- and Clique-Width -- Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms -- Fixed-Parameter Approximation: Conceptual Framework and Approximability Results -- On Parameterized Approximability -- Parameterized Approximation Problems -- An Exact Algorithm for the Minimum Dominating Clique Problem -- edge dominating set: Efficient Enumeration-Based Exact Algorithms -- Parameterized Complexity of Independence and Domination on Geometric Graphs -- Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs -- On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching -- Finding a Minimum Feedback Vertex Set in Time -- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel -- Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual -- On the Effective Enumerability of NP Problems -- The Parameterized Complexity of Enumerating Frequent Itemsets -- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems -- Towards a Taxonomy of Techniques for Designing Parameterized Algorithms -- Kernels: Annotated, Proper and Induced -- The Lost Continent of Polynomial Time: Preprocessing and Kernelization -- FPT at Work: Using Fixed Parameter Tractability to Solve Larger Instances of Hard Problems.The Second International Workshop on Parameterized and Exact Computation (IWPEC) was held in Zu ¨rich, Switzerland, during September 13–15, 2006. It th was organized as a component of ALGO 2006, which also hosted the 14 - th nual European Symposium on Algorithms, the 6 Workshop on Algorithms in th Bioinformatics, the 4 Workshop on Approximation and Online Algorithms, th and the 6 Workshop on Algorithmic Methods and Models for Optimization of Railways. This meeting was the second in the IWPEC series, with the ?rst having been held in Bergen, Norway, during September 14–16, 2004. The ?eld continues to experience rapid growth, in part due to its appeal as an alternative to tra- tional complexity theory, and in part due to the powerful practical applications it has spawned. IWPEC events are intended to cover research in all aspects of parameterizedand exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact al- rithms, parameterized complexity theory, relationships between parameterized complexity and traditional complexity, applications of parameterized and exact computation, implementation issues and high-performance computing. A major goal is to disseminate the latest research results, including signi?cant work-- progress, and to identify, de?ne and explore directions for future study. The papers accepted for presentation and printed in these proceedings rep- sent a diverse spectrum of the latest developments on parameterized and exact algorithm design, analysis, application and implementation.Theoretical Computer Science and General Issues,2512-2029 ;4169AlgorithmsComputer scienceArtificial intelligence—Data processingComputer science—MathematicsDiscrete mathematicsAlgorithmsTheory of ComputationData ScienceDiscrete Mathematics in Computer ScienceAlgorithms.Computer science.Artificial intelligence—Data processing.Computer science—Mathematics.Discrete mathematics.Algorithms.Theory of Computation.Data Science.Discrete Mathematics in Computer Science.519.5/44Bodlaender Hans Ledthttp://id.loc.gov/vocabulary/relators/edtLangston Michael Aedthttp://id.loc.gov/vocabulary/relators/edtBOOK9910483087003321Parameterized and Exact Computation772030UNINA05967nam 22007575 450 991029998290332120200705125852.01-4939-1869-910.1007/978-1-4939-1869-0(CKB)3710000000249655(Springer)9781493918690(MH)014199324-3(SSID)ssj0001354074(PQKBManifestationID)11747064(PQKBTitleCode)TC0001354074(PQKBWorkID)11322307(PQKB)11740508(DE-He213)978-1-4939-1869-0(MiAaPQ)EBC6310534(MiAaPQ)EBC5594558(Au-PeEL)EBL5594558(OCoLC)1076257108(PPN)181348594(EXLCZ)99371000000024965520140927d2014 u| 0engurnn|008mamaatxtrdacontentcrdamediacrrdacarrierClassical and Spatial Stochastic Processes With Applications to Biology /by Rinaldo B. Schinazi2nd ed. 2014.New York, NY :Springer New York :Imprint: Birkhäuser,2014.1 online resource (XII, 268 p. 334 illus., 206 illus. in color.)online resourceBibliographic Level Mode of Issuance: Monograph1-4939-1868-0 Discrete-Time Markov Chains -- Stationary Distributions of a Markov Chain -- Continuous-Time Birth and Death Markov Chains -- Percolation -- A Cellular Automaton -- Continuous-Time Branching Random Walk -- The Contact Process on a Homogeneous Tree -- Appendix: Some Facts About Probabilities on Countable Spaces -- Applications to Population Biology.- References.       .The revised and expanded edition of this textbook presents the concepts and applications of random processes with the same illuminating simplicity as its first edition, but with the notable addition of substantial modern material on biological modeling. While still treating many important problems in fields such as engineering and mathematical physics, the book also focuses on the highly relevant topics of cancerous mutations, influenza evolution, drug resistance, and immune response. The models used elegantly apply various classical stochastic models presented earlier in the text, and exercises are included throughout to reinforce essential concepts. The second edition of Classical and Spatial Stochastic Processes is suitable as a textbook for courses in stochastic processes at the advanced-undergraduate and graduate levels, or as a self-study resource for researchers and practitioners in mathematics, engineering, physics, and mathematical biology. Reviews of the first edition: An appetizing textbook for a first course in stochastic processes. It guides the reader in a very clever manner from classical ideas to some of the most interesting modern results. … All essential facts are presented with clear proofs, illustrated by beautiful examples. … The book is well organized, has informative chapter summaries, and presents interesting exercises. The clear proofs are concentrated at the ends of the chapters making it easy to find the results. The style is a good balance of mathematical rigorosity and user-friendly explanation. —Biometric Journal This small book is well-written and well-organized. ... Only simple results are treated ... but at the same time many ideas needed for more complicated cases are hidden and in fact very close. The second part is a really elementary introduction to the area of spatial processes. ... All sections are easily readable and it is rather tentative for the reviewer to learn them more deeply by organizing a course based on this book. The reader can be really surprised seeing how simple the lectures on these complicated topics can be. At the same time such important questions as phase transitions and their properties for some models and the estimates for certain critical values are discussed rigorously. ... This is indeed a first course on stochastic processes and also a masterful introduction to some modern chapters of the theory. —Zentralblatt Math     .ProbabilitiesBiomathematicsApplied mathematicsEngineering mathematicsProbability Theory and Stochastic Processeshttps://scigraph.springernature.com/ontologies/product-market-codes/M27004Genetics and Population Dynamicshttps://scigraph.springernature.com/ontologies/product-market-codes/M31010Physiological, Cellular and Medical Topicshttps://scigraph.springernature.com/ontologies/product-market-codes/M31020Mathematical and Computational Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/T11006Applications of Mathematicshttps://scigraph.springernature.com/ontologies/product-market-codes/M13003Probabilities.Biomathematics.Applied mathematics.Engineering mathematics.Probability Theory and Stochastic Processes.Genetics and Population Dynamics.Physiological, Cellular and Medical Topics.Mathematical and Computational Engineering.Applications of Mathematics.519.2Schinazi Rinaldo Bauthttp://id.loc.gov/vocabulary/relators/aut614213MiAaPQMiAaPQMiAaPQBOOK9910299982903321Classical and spatial stochastic processes1410126UNINAThis Record contains information from the Harvard Library Bibliographic Dataset, which is provided by the Harvard Library under its Bibliographic Dataset Use Terms and includes data made available by, among others the Library of Congress