Probability and statistics for computer science / / by David Forsyth |
Autore | Forsyth David |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XXIV, 367 p. 124 illus., 84 illus. in color.) |
Disciplina | 004.015114 |
Soggetto topico |
Estadística matemàtica - Informàtica
Simulació per ordinador Mathematical statistics Computer simulation Statistics Probability and Statistics in Computer Science Simulation and Modeling Statistics and Computing/Statistics Programs |
ISBN |
9783319644103
3-319-64410-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 1 Notation and conventions -- 2 First Tools for Looking at Data -- 3 Looking at Relationships -- 4 Basic ideas in probability -- 5 Random Variables and Expectations -- 6 Useful Probability Distributions -- 7 Samples and Populations -- 8 The Significance of Evidence -- 9 Experiments -- 10 Inferring Probability Models from Data -- 11 Extracting Important Relationships in High Dimensions -- 12 Learning to Classify -- 13 Clustering: Models of High Dimensional Data -- 14 Regression -- 15 Markov Chains and Hidden Markov Models -- 16 Resources. |
Record Nr. | UNINA-9910299288703321 |
Forsyth David
![]() |
||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Randomization and approximation techniques in computer science : second international workshop RANDOM '98, Barcelona, Spain, October 8-10, 1998 : proceedings / / Michael Luby, JoseÌ Rolim, Maria Serna (editors) |
Edizione | [1st ed. 1998.] |
Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [1998] |
Descrizione fisica | 1 online resource (IX, 385 p.) |
Disciplina | 004.015114 |
Collana | Lecture Notes in Computer Science |
Soggetto topico | Computer science - Statistical methods |
ISBN | 3-540-49543-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Paper -- Disjoint Paths in Expander Graphs via Random Walks: a Short Survey -- Regular Papers -- A Derandomization Using Min-Wise Independent Permutations -- An Algorithmic Embedding of Graphs via Perfect Matchings -- Deterministic Hypergraph Coloring and Its Applications -- On the Derandomization of Space-Bounded Computations -- Talagrand’s Inequality and Locality in Distributed Computing -- On-line Bin-Stretching -- Combinatorial Linear Programming: Geometry Can Help -- A Note on Bounding the Mixing Time by Linear Programming -- Robotic Exploration, Brownian Motion and Electrical Resistance -- Fringe analysis of synchronized parallel algorithms on 2–3 trees -- On Balls and Bins with Deletions -- “Balls into Bins” — A Simple and Tight Analysis -- Invited Paper -- Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs -- Regular Papers -- Using Approximation Hardness to Achieve Dependable Computation -- Complexity of Sequential Pattern Matching Algorithms -- A Random Server Model for Private Information Retrieval -- Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract) -- Randomized Lower Bounds for Online Path Coloring -- Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem -- On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem -- A High Performance Approximate Algorithm for the Steiner Problem in Graphs -- Invited Paper -- Random Geometric Problems on [0, 1]2 -- Regular Papers -- A Role of Constraint in Self-Organization -- Constructive Bounds and Exact Expectations for the Random Assignment Problem -- The “Burnside Process” Converges Slowly -- Quicksort Again Revisited -- Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems -- Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. |
Record Nr. | UNINA-9910143468603321 |
Berlin ; ; Heidelberg : , : Springer, , [1998] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Randomization and approximation techniques in computer science : second international workshop RANDOM '98, Barcelona, Spain, October 8-10, 1998 : proceedings / / Michael Luby, JoseÌ Rolim, Maria Serna (editors) |
Edizione | [1st ed. 1998.] |
Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [1998] |
Descrizione fisica | 1 online resource (IX, 385 p.) |
Disciplina | 004.015114 |
Collana | Lecture Notes in Computer Science |
Soggetto topico | Computer science - Statistical methods |
ISBN | 3-540-49543-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Paper -- Disjoint Paths in Expander Graphs via Random Walks: a Short Survey -- Regular Papers -- A Derandomization Using Min-Wise Independent Permutations -- An Algorithmic Embedding of Graphs via Perfect Matchings -- Deterministic Hypergraph Coloring and Its Applications -- On the Derandomization of Space-Bounded Computations -- Talagrand’s Inequality and Locality in Distributed Computing -- On-line Bin-Stretching -- Combinatorial Linear Programming: Geometry Can Help -- A Note on Bounding the Mixing Time by Linear Programming -- Robotic Exploration, Brownian Motion and Electrical Resistance -- Fringe analysis of synchronized parallel algorithms on 2–3 trees -- On Balls and Bins with Deletions -- “Balls into Bins” — A Simple and Tight Analysis -- Invited Paper -- Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs -- Regular Papers -- Using Approximation Hardness to Achieve Dependable Computation -- Complexity of Sequential Pattern Matching Algorithms -- A Random Server Model for Private Information Retrieval -- Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract) -- Randomized Lower Bounds for Online Path Coloring -- Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem -- On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem -- A High Performance Approximate Algorithm for the Steiner Problem in Graphs -- Invited Paper -- Random Geometric Problems on [0, 1]2 -- Regular Papers -- A Role of Constraint in Self-Organization -- Constructive Bounds and Exact Expectations for the Random Assignment Problem -- The “Burnside Process” Converges Slowly -- Quicksort Again Revisited -- Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems -- Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. |
Record Nr. | UNISA-996466108203316 |
Berlin ; ; Heidelberg : , : Springer, , [1998] | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|