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 ...

Development of more sophisticated ideas in data type and structure, with an introduction to the connection between data structures and the algorithms they support. Data abstraction. Controlled access ...

Algorithm design and analysis is fundamental to all areas of computer science and gives a rigorous framework for the study optimization. This course provides an introduction to algorithm design ...

The Annals of Statistics, Vol. 42, No. 6 (December 2014), pp. 2164-2201 (38 pages) We provide theoretical analysis of the statistical and computational properties of penalized M-estimators that can be ...

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 ...

The open-pit mining problem is to determine the contours of a mine, based on economic data and engineering feasibility requirements, to yield maximum possible net income. This practical problem needs ...

Every day, humans type out more than 200 billion emails, hundreds of millions of tweets, and innumerable texts, chats, and private messages. No one person could pick through even a tiny sliver of this ...