Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > General (F.2.0)  
 
Options:
 
  1-10 of 323 Reviews about "General (F.2.0)": Date Reviewed
  Multimodal scene understanding
Ying Yang M., Rosenhahn B., Murino V.,  ACADEMIC PRESS, London, UK, 2019. 412 pp. Type: Book (978-0-128173-58-9)

This edited book on multimodal scene understanding focuses on algorithms, applications, and deep learning. The topic of multimodal scene understanding is related to computer vision. The book’s 12 chapters are by several authors from universi...

Aug 3 2021
  Numerical analysis: theory and experiments
Sutton B.,  SIAM-Society for Industrial and Applied Mathematics, Philadelphia, PA, 2019. 431 pp. Type: Book (978-1-611975-69-7)

In the depressingly similar world of numerical analysis textbooks, Sutton’s book is a welcome relief. It is based on MATLAB, but differently to most. Many of the included methods are those not covered in other books (although there’s n...

May 17 2021
  Bandit algorithms
Lattimore T., Szepesvári C.,  Cambridge University Press, Cambridge, UK, 2020. 518 pp. Type: Book (978-1-108486-82-8)

This book is on bandit algorithms. The word “bandit” is commonly understood to mean an armed thief who is usually a member of a group or band. However, in the context of this book, bandit refers to a type of slot machine with a large m...

May 3 2021
   Understand, manage, and prevent algorithmic bias: a guide for business users and data scientists
Baer T.,  Apress, New York, NY, 2019. 260 pp. Type: Book (978-1-484248-84-3)

This is one of the most enlightening books about the hidden risks of applying machine learning techniques, and particularly algorithms, in decision making. The book unveils the many potential sources of algorithmic bias, raising serious questions ...

Aug 25 2020
  Quantum robots can fly; play games: an IBM quantum experience
Mahanti S., Das S., Behera B., Panigrahi P.  Quantum Information Processing 18(7): 1-10, 2019. Type: Article

The magic of this hypothetical robot is confined to its “brain,” which is supposed to be a full-fledged quantum computer (QC). The rest of the robot is an extended classical Braitenberg vehicle, that is, two rear wheels and a propeller...

Mar 23 2020
  What can be computed?: A practical guide to the theory of computation
MacCormick J.,  PRINCETON UNIVERSITY PRESS, Princeton, NJ, 2018. 408 pp. Type: Book (978-0-691170-66-4), Reviews: (2 of 2)

Teaching the theory of computation and complexity is tough. It is especially challenging for those ambitious teachers who wish to provide more than just the basic data that programmers ought to know. In fact, the basic data is quite a small set of...

May 1 2019
  The subset assignment problem for data placement in caches
Ghandeharizadeh S., Irani S., Lam J.  Algorithmica 80(7): 2201-2220, 2018. Type: Article

This paper gives an approximation algorithm for the subset assignment problem (SAP). Given a set of n items of varying sizes, a set of d bins of varying capacities, and a cost c(p
Mar 6 2019
   What can be computed?: A practical guide to the theory of computation
MacCormick J.,  PRINCETON UNIVERSITY PRESS, Princeton, NJ, 2018. 408 pp. Type: Book (978-0-691170-66-4), Reviews: (1 of 2)

What should be in a first course on the theory of computation? For 50 years, there has only been one answer: formal grammars and their corresponding automata. Hopcroft and Ullman’s book has been the standard [1], but there are dozens if not ...

Feb 21 2019
  Once upon an algorithm: how stories explain computing
Erwig M.,  The MIT Press, Cambridge, MA, 2017. 336 pp. Type: Book (978-0-262036-63-4)

Martin Erwig emphasizes the general nature of computation and the use of computer science (CS) in this book. He uses well-known stories to explain computing concepts to readers not familiar with the field....

Sep 21 2018
  Recent developments in metaheuristics
Amodeo L., Talbi E., Yalaoui F.,  Springer International Publishing, New York, NY, 2017. 496 pp. Type: Book (978-3-319582-52-8)

A metaheuristic is a procedure or heuristic used to discover, yield, or choose a heuristic that may furnish a decent solution to an optimization problem....

Apr 26 2018
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2021 ThinkLoud, Inc.
Terms of Use
| Privacy Policy