Michele Mosca of the Institute for Quantum Computing and Dept. of Combinatorics & Optimization, University of Waterloo and St. Jerome’s University, and Perimeter Institute for Theoretical Physics ...

Many aspects of modern applied research rely on a crucial algorithm called gradient descent. This is a procedure generally used for finding the largest or smallest values of a particular mathematical ...

Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

In this Artificial Intelligence podcast with Lex Fridman, computer scientist Donald Knuth discusses Alan Turing, Neural networks, machine learning and other AI topics from ant colonies and human ...

One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing ...

For humans, identifying items in a scene — whether that’s an avocado or an Aventador, a pile of mashed potatoes or an alien mothership — is as simple as looking at them. But for artificial ...

Researchers at FIU’s College of Engineering and Computing have developed an encryption algorithm to defend videos from attackers with access to the world's most powerful computers. The encryption ...