Cantitate/Preț
Produs

Probability in Electrical Engineering and Computer Science

Autor Jean Walrand
en Limba Engleză Paperback
The book is designed for a junior/senior level course. Applications drive the material: PageRank, Multiplexing, Digital Link, Tracking, Speech Recognition, Route Planning and more. Topics include Markov chains, detection, coding, estimation, Viterbi algorithm, expectation maximization, clustering, compressed sensing, recommender systems, Kalman Filter, Markov decision problems, LQG, and channel capacity. Matlab examples are used to simulate models and to implement the algorithms. Appendices provide the necessary background in basic probability and linear algebra. See https: //sites.google.com/site/walrandpeecs/home.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 24057 lei  3-5 săpt. +2535 lei  7-13 zile
  Springer International Publishing – 24 iun 2022 24057 lei  3-5 săpt. +2535 lei  7-13 zile
  Quoi? – 39404 lei  6-8 săpt.
Hardback (1) 33508 lei  6-8 săpt.
  Springer International Publishing – 23 iun 2021 33508 lei  6-8 săpt.

Preț: 39404 lei

Preț vechi: 49256 lei
-20% Nou

Puncte Express: 591

Preț estimativ în valută:
7544 7841$ 6254£

Carte tipărită la comandă

Livrare economică 06-20 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780615899367
ISBN-10: 0615899366
Pagini: 314
Dimensiuni: 152 x 229 x 23 mm
Greutate: 0.59 kg
Editura: Quoi?

Cuprins

Chapter 1. Page Rank - A.- Chapter 2. Page Rank - B.- Chapter 3. Multiplexing - A.- Chapter 4. Multiplexing - B.- Chapter 5. Networks - A.- Chapter 6. Networks - B.- Chapter 7. Digital Link - A.- Chapter 8. Digital Link - B.- Chapter 9. Tracking - A.- Chapter 10. Tracking - B.- Chapter 11. Speech Recognition - A.- Chapter 12. Speech Recognition - B.- Chapter 13. Route planning - A.- Chapter 14. Route Planning - B.- chapter 15. Perspective & Complements.- A. Elementary Probability.- B. Basic Probability.- . Index.

Notă biografică

Jean Camille Walrand is a professor emeritus of Electrical Engineering and Computer Science at UC Berkeley. He received his Ph.D. from the Department of Electrical Engineering and Computer Sciences department at the University of California, Berkeley, and has been on the faculty of that department since 1982. He is the author of "An Introduction to Queueing Networks" (Prentice Hall, 1988), "Communication Networks: A First Course" (2nd ed. McGraw-Hill,1998), and “Uncertainty: A User Guide” (Amazon, 2019) and co-author of "High-Performance Communication Networks" (2nd ed, Morgan Kaufmann, 2000), "Communication Networks: A Concise Introduction" (2nd ed, Morgan & Claypool, 2017),  "Scheduling and Congestion Control for Communication and Processing networks" (Morgan & Claypool, 2010), and “Sharing Network Resources” (Morgan & Claypool, 2014). His research interests include stochastic processes, queuing theory, communication networks, game theory, and the economics of theInternet. Walrand has received numerous awards for his work over the years. He is a Fellow of the Belgian American Education Foundation and of the IEEE. Additionally, he is a recipient of the Lanchester Prize, the Stephen O. Rice Prize., the IEEE Kobayashi Award, and the ACM SIGMETRICS Achievement Award.

Textul de pe ultima copertă

This revised textbook motivates and illustrates the techniques of applied probability by applications in electrical engineering and computer science (EECS). The author presents information processing and communication systems that use algorithms based on probabilistic models and techniques, including web searches, digital links, speech recognition, GPS, route planning, recommendation systems, classification, and estimation. He then explains how these applications work and, along the way, provides the readers with the understanding of the key concepts and methods of applied probability. Python labs enable the readers to experiment and consolidate their understanding. The book includes homework, solutions, and Jupyter notebooks. This edition includes new topics such as Boosting, Multi-armed bandits, statistical tests, social networks, queuing networks, and neural networks. The companion website now has many examples of Python demos and also Python labs used in Berkeley.

  • Showcases techniques of applied probability with applications in EE and CS;
  • Presents all topics with concrete applications so students see the relevance of the theory;
  • Illustrates methods with Jupyter notebooks that use widgets to enable the users to modify parameters.

Caracteristici

Showcases techniques of applied probability with applications in EE and CS Presents all topics with concrete applications so students see the relevance of the theory Illustrates methods with Jupyter notebooks that use widgets to enable the users to modify parameters This book is open access, which means that you have free and unlimited access