|
|
Sold Out
Book Categories |
1. Chernoff–Hoeffding bounds; 2. Applying the CH-bounds; 3. CH-bounds with dependencies; 4. Interlude: probabilistic recurrences; 5. Martingales and the MOBD; 6. The MOBD in action; 7. Averaged bounded difference; 8. The method of bounded variances; 9. Interlude: the infamous upper tail; 10. Isoperimetric inequalities and concentration; 11. Talagrand inequality; 12. Transportation cost and concentration; 13. Transportation cost and Talagrand's inequality; 14. Log–Sobolev inequalities; Appendix A. Summary of the most useful bounds.
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Concentration of Measure for the Analysis of Randomized Algorithms
X
This Item is in Your Inventory
Concentration of Measure for the Analysis of Randomized Algorithms
X
You must be logged in to review the productsX
X
X
Add Concentration of Measure for the Analysis of Randomized Algorithms, Randomized algorithms have become a central part of the algorithms curriculum based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high- probabilit, Concentration of Measure for the Analysis of Randomized Algorithms to the inventory that you are selling on WonderClubX
X
Add Concentration of Measure for the Analysis of Randomized Algorithms, Randomized algorithms have become a central part of the algorithms curriculum based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high- probabilit, Concentration of Measure for the Analysis of Randomized Algorithms to your collection on WonderClub |