Download Free Computer Ebooks - NET BOOKS

Matrix Algorithms

Posted by GaQuay under Algorithms

Matrix Algorithms

Book Description
This thorough, concise, and superbly written volume is the first in a self-contained five-volume series devoted to matrix algorithms. It focuses on the computation of matrix decompositions - the factorization of matrices into products of similar ones. The first two chapters provide the required background from mathematics and computer science needed to work effectively in matrix computations. The remaining chapters are devoted to the computation and applications of the LU and QR decompositions. The series is aimed at the nonspecialist who needs more than black-box proficiency with matrix computations. A certain knowledge of elementary analysis and linear algebra is assumed, as well as a reasonable amount of programming experience. The guiding principle, that if something is worth explaining, it is worth explaining fully, has necessarily restricted the scope of the series, but the selection of topics should give the reader a sound basis for further study.

Mastering Algorithms with Perl

Posted by GaQuay under Algorithms, Perl

Mastering Algorithms with Perl

Written for readers with at least some Perl programming experience, Mastering Algorithms in Perl delivers a solid library of algorithms written in Perl for business and mathematical computing. From data structures to cryptography and more advanced mathematical algorithms, this book provides a worthwhile guide to extending Perl’s coding capabilities.

The best thing about Mastering Algorithms in Perl is the scope at which it covers the universe of algorithms while refraining from getting bogged down in academic detail. Besides basic data structures–a lynchpin of books on algorithms–the authors provide dozens and dozens of algorithms for sorting, searching, and doing mathematical computations of all kinds. While they discuss “Big-O” notation and assume a general familiarity with math, they don’t overwhelm the reader. (You can even borrow the code without needing a math degree to understand it.) The focus is on efficient, reusable Perl subroutines written and compiled by three Perl experts.

Ant Colony Optimization

Posted by GaQuay under Algorithms

Ant Colony Optimization

Book Description
The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.

Algorithms on Strings

Posted by GaQuay under Algorithms

Algorithms on Strings

Book Description
This text and reference on string processes and pattern matching presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases. Algorithms are described in a C-like language, with correctness proofs and complexity analysis, to make them ready to implement.

Cambridge University Press Visibility Algorithms in The Plane

Posted by GaQuay under Algorithms

Springer Inside Relational Databases with Examples in Access

Book Description
A human observer can effortlessly identify visible portions of geometric objects present in the environment. However, computations of visible portions of objects from a viewpoint involving thousands of objects is a time consuming task even for high speed computers. To solve such visibility problems, efficient algorithms have been designed. This book presents some of these visibility algorithms in two dimensions. Specifically, basic algorithms for point visibility, weak visibility, shortest paths, visibility graphs, link paths and visibility queries are all discussed. Several geometric properties are also established through lemmas and theorems. With over 300 figures and hundreds of exercises, this book is ideal for graduate students and researchers in the field of computational geometry.