enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. John Alan Robinson - Wikipedia

    en.wikipedia.org/wiki/John_Alan_Robinson

    John Alan Robinson (9 March 1930 – 5 August 2016) was a philosopher, mathematician, and computer scientist.He was a professor emeritus at Syracuse University.. Alan Robinson's major contribution is to the foundations of automated theorem proving.

  3. Master theorem (analysis of algorithms) - Wikipedia

    en.wikipedia.org/wiki/Master_theorem_(analysis...

    Introduction to Algorithms, Second Edition. MIT Press and McGraw–Hill, 2001. ISBN 0-262-03293-7. Sections 4.3 (The master method) and 4.4 (Proof of the master theorem), pp. 73–90. Michael T. Goodrich and Roberto Tamassia. Algorithm Design: Foundation, Analysis, and Internet Examples. Wiley, 2002. ISBN 0-471-38365-1. The master theorem ...

  4. Heejin - Wikipedia

    en.wikipedia.org/wiki/Heejin

    Jeon Hee-jin (Korean: 전희진, Korean pronunciation: [tɕʌn çidʑin]; born October 19, 2000), known mononymously as Heejin (occasionally stylized as HeeJin) is a South Korean singer. She is a member of Loona , its sub-unit Loona 1/3 , and Artms .

  5. The Art of Computer Programming - Wikipedia

    en.wikipedia.org/wiki/The_Art_of_Computer...

    In January 1962, when he was a graduate student in the mathematics department at Caltech, Knuth was approached by Addison-Wesley to write a book about compiler design, and he proposed a larger scope. He came up with a list of twelve chapter titles the same day.

  6. Kurt Mehlhorn - Wikipedia

    en.wikipedia.org/wiki/Kurt_Mehlhorn

    Mehlhorn is the author of several books and over 250 scientific publications, [8] which include fundamental contributions to data structures, computational geometry, computer algebra, parallel computing, VLSI design, computational complexity, combinatorial optimization, and graph algorithms.

  7. Introduction to Algorithms - Wikipedia

    en.wikipedia.org/wiki/Introduction_to_Algorithms

    Introduction to Algorithms is a book on computer programming by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.The book is described by its publisher as "the leading algorithms text in universities worldwide as well as the standard reference for professionals". [1]

  8. Timeline of algorithms - Wikipedia

    en.wikipedia.org/wiki/Timeline_of_algorithms

    1995 – AdaBoost algorithm, the first practical boosting algorithm, was introduced by Yoav Freund and Robert Schapire; 1995 – soft-margin support vector machine algorithm was published by Vladimir Vapnik and Corinna Cortes. It adds a soft-margin idea to the 1992 algorithm by Boser, Nguyon, Vapnik, and is the algorithm that people usually ...

  9. Algorithmic Puzzles - Wikipedia

    en.wikipedia.org/wiki/Algorithmic_Puzzles

    The puzzles in the book cover a wide range of difficulty, and in general do not require more than a high school level of mathematical background. [3] William Gasarch notes that grouping the puzzles only by their difficulty and not by their themes is actually an advantage, as it provides readers with fewer clues about their solutions.