LEADER 06081nam 22007815 450 001 9910143623603321 005 20200701081919.0 010 $a3-540-45253-2 024 7 $a10.1007/3-540-45253-2 035 $a(CKB)1000000000211290 035 $a(SSID)ssj0000321189 035 $a(PQKBManifestationID)11256250 035 $a(PQKBTitleCode)TC0000321189 035 $a(PQKBWorkID)10263098 035 $a(PQKB)10172761 035 $a(DE-He213)978-3-540-45253-9 035 $a(MiAaPQ)EBC3071876 035 $a(PPN)155188607 035 $a(EXLCZ)991000000000211290 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms - ESA 2000 $e8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings /$fedited by Mike Paterson 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (X, 450 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1879 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-41004-X 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Papers -- Web Information Retrieval - an Algorithmic Perspective -- Computational Biology ? Algorithms and More -- Contributed Papers -- Polygon Decomposition for Efficient Construction of Minkowski Sums -- An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts -- Offline List Update is NP-hard -- Computing Largest Common Point Sets under Approximate Congruence -- Online Algorithms for Caching Multimedia Streams -- On Recognizing Cayley Graphs -- Fast Algorithms for Even/Odd Minimum Cuts and Generalizations -- Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs -- Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset -- Range Searching over Tree Cross Products -- A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem -- The Minimum Range Assignment Problem on Linear Radio Networks -- Property Testing in Computational Geometry -- On R-Trees with Low Stabbing Number -- K-D Trees Are Better when Cut on the Longest Side -- On Multicriteria Online Problems -- Online Scheduling Revisited -- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem -- I/O-Efficient Well-Separated Pair Decomposition and Its Applications -- Higher Order Delaunay Triangulations -- On Representations of Algebraic-Geometric Codes for List Decoding -- Minimizing a Convex Cost Closure Set -- Preemptive Scheduling with Rejection -- Simpler and Faster Vertex-Connectivity Augmentation Algorithms -- Scheduling Broadcasts in Wireless Networks -- Jitter Regulation in an Internet Router with Delay Consideration -- Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points -- Resource Constrained Shortest Paths -- On the Competitiveness of Linear Search -- Maintaining a Minimum Spanning Tree under Transient Node Failures -- Minimum Depth Graph Embedding -- New Algorithms for Two-Label Point Labeling -- Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms -- How Helpers Hasten h-Relations -- Computing Optimal Linear Layouts of Trees in Linear Time -- Coloring Sparse Random Graphs in Polynomial Average Time -- Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine -- Collision Detection Using Bounding Boxes: Convexity Helps. 330 $aThis book constitutes the refereed proceedings of the 8th Annual European Symposium on Algorithms, ESA 2000, held in Saarbrücken, Germany in September 2000. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are parallelism, distributed systems, approximation, combinatorial optimization, computational biology, computational geometry, external-memory algorithms, graph algorithms, network algorithms, online algorithms, data compression, symbolic computation, pattern matching, and randomized algorithms. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1879 606 $aComputer programming 606 $aData structures (Computer science) 606 $aApplication software 606 $aAlgorithms 606 $aComputer graphics 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aData Structures and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15009 606 $aComputer Applications$3https://scigraph.springernature.com/ontologies/product-market-codes/I23001 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aComputer programming. 615 0$aData structures (Computer science) 615 0$aApplication software. 615 0$aAlgorithms. 615 0$aComputer graphics. 615 14$aProgramming Techniques. 615 24$aData Structures and Information Theory. 615 24$aComputer Applications. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aData Structures. 615 24$aComputer Graphics. 676 $a004.015118 702 $aPaterson$b Mike$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aESA 2000 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143623603321 996 $aAlgorithms - ESA 2000$91980334 997 $aUNINA LEADER 03191nam 2200673Ia 450 001 9910972858903321 005 20251117073037.0 010 $a1-282-27431-7 010 $a9786612274312 010 $a1-60795-077-4 035 $a(CKB)2420000000005442 035 $a(OCoLC)649863748 035 $a(CaPaEBR)ebrary10409618 035 $a(SSID)ssj0000305673 035 $a(PQKBManifestationID)11225958 035 $a(PQKBTitleCode)TC0000305673 035 $a(PQKBWorkID)10293246 035 $a(PQKB)10956131 035 $a(MiAaPQ)EBC3386885 035 $a(Au-PeEL)EBL3386885 035 $a(CaPaEBR)ebr10409618 035 $a(CaONFJC)MIL227431 035 $a(OCoLC)923337280 035 $a(BIP)46211361 035 $a(BIP)76952005 035 $a(EXLCZ)992420000000005442 100 $a20030327d2003 uy 0 101 0 $aeng 135 $aurcn||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aPDQ statistics /$fGeoffrey R. Norman, David L. Streiner 205 $a3rd ed. 210 $aHamilton, Ont. $cB.C. Decker$dc2003 215 $a1 online resource (230 p.) 225 1 $aPDQ series 300 $aIncludes index. 311 08$a1-60795-286-6 311 08$a1-55009-207-3 327 $aIntro -- Title and Frontmatter -- Preface to Third Edition -- Contents -- Introduction -- Part 1: Variables and Descriptive Statistics -- 1. Names and Numbers: Types of Variables -- 2. Describing Data -- Part 2: Parametric Statistics -- 3. Statistical Inference -- 4. Comparison of Means of Two Samples: The t Test -- 5. Comparison among Many Means: Analysis of Variance -- 6. Relationship between Interval and Ratio Variables: Linear and Multiple Regression -- 7. Analysis of Covariance -- 8. Variations on Linear Regression: Logistic Regression, General Linear Model, and Hierarchical Linear Models -- 9. Time Series Analysis -- Part 3: Nonparametric Statistics -- 10. Nonparametric Tests of Significance -- 11. Nonparametric Measures of Association -- 12. Advanced Nonparametric Methods -- Part 4: Multivariate Statistics -- 13. Introduction to Multivariate Statistics -- 14. Multivariate Analysis of Variance -- 15. Discriminant Function Analysis -- 16. Exploratory Factor Analysis -- 17. Path Analysis and Structural Equation Modeling -- 18. Cluster Analysis -- 19. Canonical Correlation -- 20. Reprise -- 21. Research Designs -- Index. 330 $a'PDQ Statistics, Third Edition offers an expert overview of all major statistical methods, giving the reader a thorough understanding of statistics and how they are used in research articles. The book covers the major categories variable and descriptiv" 410 0$aPDQ series. 517 3 $aPretty darned quick statistics 517 3 $aPrettyDarnedQuick statistics 606 $aMedical statistics 606 $aBiometry 615 0$aMedical statistics. 615 0$aBiometry. 676 $a610/.72 700 $aNorman$b Geoffrey R$0726060 701 $aStreiner$b David L$0726059 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910972858903321 996 $aPDQ statistics$94471894 997 $aUNINA