Concentration of measure for the analysis of randomized algorithms / / Devdatt Dubhashi, Alessandro Panconesi [[electronic resource]] |
Autore | Dubhashi Devdatt |
Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2009 |
Descrizione fisica | 1 online resource (xiv, 196 pages) : digital, PDF file(s) |
Disciplina | 518/.1 |
Soggetto topico |
Random variables
Distribution (Probability theory) Limit theorems (Probability theory) Algorithms |
ISBN |
1-107-20031-8
1-139-63769-X 1-282-30277-9 9786612302770 0-511-58063-0 0-511-58095-9 0-511-57955-1 0-511-57881-4 0-511-58127-0 0-511-58029-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Chernoff-Hoeffding bounds -- Applications of the Chernoff-Hoeffding bounds -- Chernoff-Hoeffding bounds in dependent settings -- Interlude : probabilistic recurrences -- Martingales and the method of bounded differences -- The simple method of bounded differences in action -- The method of averaged bounded differences -- The method of bounded variances -- Interlude : the infamous upper tail -- Isoperimetric inequalities and concentration -- Talagrand's isoperimetric inequality -- Isoperimetric inequalities and concentration via transportation cost inequalities -- Quadratic transportation cost and Talagrand's inequality -- Log-Sobolev inequalities and concentration -- Appendix A : summary of the most useful bounds. |
Record Nr. | UNINA-9910454552903321 |
Dubhashi Devdatt
![]() |
||
Cambridge : , : Cambridge University Press, , 2009 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Concentration of measure for the analysis of randomized algorithms / / Devdatt Dubhashi, Alessandro Panconesi [[electronic resource]] |
Autore | Dubhashi Devdatt |
Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2009 |
Descrizione fisica | 1 online resource (xiv, 196 pages) : digital, PDF file(s) |
Disciplina | 518/.1 |
Soggetto topico |
Random variables
Distribution (Probability theory) Limit theorems (Probability theory) Algorithms |
ISBN |
1-107-20031-8
1-139-63769-X 1-282-30277-9 9786612302770 0-511-58063-0 0-511-58095-9 0-511-57955-1 0-511-57881-4 0-511-58127-0 0-511-58029-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Chernoff-Hoeffding bounds -- Applications of the Chernoff-Hoeffding bounds -- Chernoff-Hoeffding bounds in dependent settings -- Interlude : probabilistic recurrences -- Martingales and the method of bounded differences -- The simple method of bounded differences in action -- The method of averaged bounded differences -- The method of bounded variances -- Interlude : the infamous upper tail -- Isoperimetric inequalities and concentration -- Talagrand's isoperimetric inequality -- Isoperimetric inequalities and concentration via transportation cost inequalities -- Quadratic transportation cost and Talagrand's inequality -- Log-Sobolev inequalities and concentration -- Appendix A : summary of the most useful bounds. |
Record Nr. | UNINA-9910777912603321 |
Dubhashi Devdatt
![]() |
||
Cambridge : , : Cambridge University Press, , 2009 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Concentration of measure for the analysis of randomized algorithms / / Devdatt Dubhashi, Alessandro Panconesi |
Autore | Dubhashi Devdatt |
Edizione | [1st ed.] |
Pubbl/distr/stampa | New York, : Cambridge University Press, 2009 |
Descrizione fisica | 1 online resource (xiv, 196 pages) : digital, PDF file(s) |
Disciplina | 518/.1 |
Altri autori (Persone) | PanconesiAlessandro |
Soggetto topico |
Random variables
Distribution (Probability theory) Limit theorems (Probability theory) Algorithms |
ISBN |
1-107-20031-8
1-139-63769-X 1-282-30277-9 9786612302770 0-511-58063-0 0-511-58095-9 0-511-57955-1 0-511-57881-4 0-511-58127-0 0-511-58029-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Chernoff-Hoeffding bounds -- Applications of the Chernoff-Hoeffding bounds -- Chernoff-Hoeffding bounds in dependent settings -- Interlude : probabilistic recurrences -- Martingales and the method of bounded differences -- The simple method of bounded differences in action -- The method of averaged bounded differences -- The method of bounded variances -- Interlude : the infamous upper tail -- Isoperimetric inequalities and concentration -- Talagrand's isoperimetric inequality -- Isoperimetric inequalities and concentration via transportation cost inequalities -- Quadratic transportation cost and Talagrand's inequality -- Log-Sobolev inequalities and concentration -- Appendix A : summary of the most useful bounds. |
Record Nr. | UNINA-9910819144403321 |
Dubhashi Devdatt
![]() |
||
New York, : Cambridge University Press, 2009 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Integer Programming and Combinatorial Optimization [[electronic resource] ] : 13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings / / edited by Andrea Lodi, Alessandro Panconesi, Giovanni Rinaldi |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XI, 477 p.) |
Disciplina | 519.7/7 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Numerical analysis Algorithms Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics |
ISBN | 3-540-68891-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Session 1 -- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables -- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs -- The Air Traffic Flow Management Problem: An Integer Optimization Approach -- Session 2 -- The Induced Disjoint Paths Problem -- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs -- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs -- A Polynomial Algorithm for Weighted Abstract Flow -- Session 3 -- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem -- Binary Positive Semidefinite Matrices and Associated Integer Polytopes -- Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities -- Session 4 -- Tight Bounds for Permutation Flow Shop Scheduling -- The Stochastic Machine Replenishment Problem -- A Polynomial Time Approximation Scheme for the Square Packing Problem -- Session 5 -- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints -- Computing with Multi-row Gomory Cuts -- Constraint Orbital Branching -- Session 6 -- A Fast, Simpler Algorithm for the Matroid Parity Problem -- Degree Bounded Matroids and Submodular Flows -- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle -- Session 7 -- Primal-Dual Schema for Capacitated Covering Problems -- Offline and Online Facility Leasing -- Importance Sampling via Load-Balanced Facility Location -- Session 8 -- A Constant Approximation Algorithm for the a priori Traveling Salesman Problem -- New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem -- Min Sum Edge Coloring in Multigraphs Via Configuration LP -- Session 9 -- An Improved Algorithm for Finding Cycles Through Elements -- The Stable Roommates Problem with Choice Functions -- A New Approach to Splitting-Off -- Session 10 -- Can Pure Cutting Plane Algorithms Work? -- The Mixing Set with Divisible Capacities -- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging -- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. |
Record Nr. | UNISA-996465589803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Integer programming and combinatorial optimization : 13th international conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008 : proceedings / / Andrea Lodi, Alessandro Panconesi, Giovanni Rinaldi (eds.) |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin ; ; New York, : Springer, 2008 |
Descrizione fisica | 1 online resource (XI, 477 p.) |
Disciplina | 519.7/7 |
Altri autori (Persone) |
LodiAndrea
PanconesiAlessandro RinaldiGiovanni |
Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
Soggetto topico |
Integer programming
Combinatorial optimization |
ISBN | 3-540-68891-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Session 1 -- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables -- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs -- The Air Traffic Flow Management Problem: An Integer Optimization Approach -- Session 2 -- The Induced Disjoint Paths Problem -- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs -- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs -- A Polynomial Algorithm for Weighted Abstract Flow -- Session 3 -- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem -- Binary Positive Semidefinite Matrices and Associated Integer Polytopes -- Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities -- Session 4 -- Tight Bounds for Permutation Flow Shop Scheduling -- The Stochastic Machine Replenishment Problem -- A Polynomial Time Approximation Scheme for the Square Packing Problem -- Session 5 -- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints -- Computing with Multi-row Gomory Cuts -- Constraint Orbital Branching -- Session 6 -- A Fast, Simpler Algorithm for the Matroid Parity Problem -- Degree Bounded Matroids and Submodular Flows -- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle -- Session 7 -- Primal-Dual Schema for Capacitated Covering Problems -- Offline and Online Facility Leasing -- Importance Sampling via Load-Balanced Facility Location -- Session 8 -- A Constant Approximation Algorithm for the a priori Traveling Salesman Problem -- New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem -- Min Sum Edge Coloring in Multigraphs Via Configuration LP -- Session 9 -- An Improved Algorithm for Finding Cycles Through Elements -- The Stable Roommates Problem with Choice Functions -- A New Approach to Splitting-Off -- Session 10 -- Can Pure Cutting Plane Algorithms Work? -- The Mixing Set with Divisible Capacities -- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging -- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. |
Altri titoli varianti | IPCO 2008 |
Record Nr. | UNINA-9910483927303321 |
Berlin ; ; New York, : Springer, 2008 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
WSDM 2013 : proceedings of the 6th ACM International Conference on Web Search and Data Mining : February 4-8, 2013, Rome, Italy |
Autore | Leonardi Stefano |
Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2013 |
Descrizione fisica | 1 online resource (798 pages) |
Collana | ACM Conferences |
Soggetto topico |
Social Sciences
Library & Information Science |
ISBN | 1-4503-1869-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti |
Web Search and Data Mining 2013 : proceedings of the 6th ACM International Conference on Web Search and Data Mining : February 4-8, 2013, Rome, Italy
Proceedings of the sixth ACM International Conference on Web Search and Data Mining WSDM 2013 sixth ACM International Conference on Web Search and Data Mining, Rome, Italy - February 04 - 08, 2013 |
Record Nr. | UNINA-9910375881703321 |
Leonardi Stefano
![]() |
||
[Place of publication not identified], : ACM, 2013 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
WWW '15 Companion : Proceedings of the 24th International Conference on World Wide Web / / Aldo Gangemi, Stefano Leonardi, Alessandro Panconesi |
Autore | Gangemi Aldo |
Pubbl/distr/stampa | Republic and Canton of Geneva : , : ACM, , 2015 |
Descrizione fisica | 1 online resource (1562 pages) |
Disciplina | 004 |
Soggetto topico |
Computer science
Electronic data processing |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910490050003321 |
Gangemi Aldo
![]() |
||
Republic and Canton of Geneva : , : ACM, , 2015 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|