|
Dòng
|
Nội dung
|
|
1
|
Algorithm design with Haskell / Richard Bird, Jeremy Gibbons
London : Cambridge University Press, 2020
450 p. ; 27 cm.
Ký hiệu phân loại (DDC): 005.13
This book is devoted to five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. These principles are presented using Haskell, a purely functional language, leading to simpler explanations and shorter programs than would be obtained with imperative languages. Carefully selected examples, both new and standard, reveal the commonalities and highlight the differences between algorithms. The algorithm developments use equational reasoning where applicable, clarifying the applicability conditions and correctness arguments. Every chapter concludes with exercises (nearly 300 in total), each with complete answers, allowing the reader to consolidate their understanding and apply the techniques to a range of problems. The book serves students (both undergraduate and postgraduate), researchers, teachers, and professionals who want to know more about what goes into a good algorithm and how such algorithms can be expressed in purely functional terms
Số bản sách:
(1)
Tài liệu số:
(0)
|
|
2
|
|
|
3
|
|
|
4
|
Computers and intractability : a guide to the theory of NP-completeness / Michael R Garey; David S Johnson
San Francisco : W.H. Freeman, 1979
x, 338 pages. : illustrations ; 23 cm.
Ký hiệu phân loại (DDC): 005.1
"Shows how to recognize NP-complete problems and offers proactical suggestions for dealing with them effectively. The book covers the basic theory of NP-completeness, provides an overview of alternative directions for further research, and contains and extensive list of NP-complete and NP-hard problems, with more than 300 main entries and several times as many results in total. [This book] is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity. It provides not only a valuable source of information for students but also an essential reference work for professionals in computer science"-
Số bản sách:
(1)
Tài liệu số:
(0)
|
|
5
|
Concise computer vision : an introduction into theory and algorithms / Reinhard Klette
London : Springer, 2014
xviii, 429 p. : Illustrations ; 23 cm.
Ký hiệu phân loại (DDC): 006.37
Many textbooks on computer vision can be unwieldy and intimidating in their coverage of this extensive discipline. This textbook addresses the need for a concise overview of the fundamentals of this field. Concise Computer Vision provides an accessible general introduction to the essential topics in computer vision, highlighting the role of important algorithms and mathematical concepts. Classroom-tested programming exercises and review questions are also supplied at the end of each chapter. Topics and features: Provides an introduction to the basic notation and mathematical concepts for describing an image, and the key concepts for mapping an image into an image Explains the topologic and geometric basics for analysing image regions and distributions of image values, and discusses identifying patterns in an image Introduces optic flow for representing dense motion, and such topics in sparse motion analysis as keypoint detection and descriptor definition, and feature tracking using the Kalman filter Describes special approaches for image binarization and segmentation of still images or video frames.
Số bản sách:
(2)
Tài liệu số:
(0)
|
|
|
|
|