Mostrar mensagens com a etiqueta Textbook. Mostrar todas as mensagens
Mostrar mensagens com a etiqueta Textbook. Mostrar todas as mensagens

quarta-feira, 9 de janeiro de 2019

BOOK: Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne

A book on algorithms. Remember to explore this Princeton university site for more information will you?



This is the online version: Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne



Quoting:

"Textbook. 

 The textbook Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne [ Amazon · Pearson · InformIT ] surveys the most important algorithms and data structures in use today. We motivate each algorithm that we address by examining its impact on applications to science, engineering, and industry. The textbook is organized into six chapters:

  • Chapter 1: Fundamentals introduces a scientific and engineering basis for comparing algorithms and making predictions. It also includes our programming model.
  • Chapter 2: Sorting considers several classic sorting algorithms, including insertion sort, mergesort, and quicksort. It also features a binary heap implementation of a priority queue.
  • Chapter 3: Searching describes several classic symbol-table implementations, including binary search trees, red–black trees, and hash tables.
  • Chapter 4: Graphs surveys the most important graph-processing problems, including depth-first search, breadth-first search, minimum spanning trees, and shortest paths.
  • Chapter 5: Strings investigates specialized algorithms for string processing, including radix sorting, substring search, tries, regular expressions, and data compression.
  • Chapter 6: Context highlights connections to systems programming, scientific computing, commercial applications, operations research, and intractability.

Booksite. 

 Reading a book and surfing the web are two different activities: This booksite is intended for your use while online (for example, while programming and while browsing the web); the textbook is for your use when initially learning new material and when reinforcing your understanding of that material (for example, when reviewing for an exam). The booksite consists of the following elements:
  • Excerpts. A condensed version of the text narrative, for reference while online.
  • Java code. The algorithms and clients [ algs4 · github ] in this textbook.
  • Exercise solutions. Solutions to selected exercises.

For students:


For instructors:


"

quarta-feira, 30 de agosto de 2017

What is AI?

http://www.kdnuggets.com/2017/04/grakn-artificial-intelligence-ingredients-intelligence.html

Quoting:
"So what does it really mean for an application to be “intelligent”? What does it take to create a system that is “artificially intelligent?
(...) The Turing Test. “A computer would deserve to be called intelligent if it could deceive a human into believing that it was human,” said Turing. Since its advent in the 1950s, it has been the most common litmus test employed in AI. The test is rudimentary but it presents a baseline that needs to be reached before it can be considered intelligent.

Fooling Turing — Components of an AI system
 
(...) create a system that can pass the Turing Test.
According to Norvig and Russell:

In order to pass the Turing Test, the computer would need to possess the following capabilities:

natural language processing,
knowledge representation,
automated reasoning, and
machine learning

Now, I assume you already trust that I’m quoting from an authoritative source, but in case there’s any doubt (or if your memory needs jogging), Norvig and Russell are AI heavyweights. Dr Norvig is currently Director of Research at Google, and Dr Russell is a Professor of Computer Science at UC Berkeley. They literally wrote the textbook on artificial intelligence used in more than 1100 universities in the world."