Algorithms Books

If you don't already know the C programming language, this is probably a pretty good book on C++ programming basics. It goes into control structures, arrays, strings, pointers, recursion, and abstract data types, among other topics. It even has a good introductory chapter on the basics of computing that even includes information on the binary and hex number systems. In that sense, it is good enough to stand alone as a pretty good textbook. However, there is one major component missing from this outline that is essential for anyone who claims to know C++ in any meaningful way, that being any mention of object-oriented programming constructs as expressed in the C++ language. If you don't know object orientation as it is expressed in C++, then you are just a C programmer programming with C++ notation. Thus, this outline is not wrong, it is just woefully incomplete. I still give it three stars because for the right audience it is a good beginner's text at a very cheap price. For those who are interested in learning object orientation as it is expressed in the C++ language, I instead recommend "Schaum's Outline of Programming with C++". In that book there is less of an emphasis on algorithms and computing and more of an emphasis on teaching the complete language with all of its components.

This is the C++ guide in the famous Schaum's outlines series. It teaches you the foundation's of C++ fairly well, as usual with a great load of examples and code snippets. We are used to this by Schaum.

What I am missing is in-depth information. How do I use make to compile bigger programs? How do I use the STL? How do I use glib?

This book will scratch the surface, and will probably be an ok guide for a novice. But if you want to take a step further after the first weeks of learning C++, you will have to look elsewhere.

I am a 12 year old male who just happens to be interested in learning C/C++. Someone showed this book to me and highly recommended it. I have found that the text is simple to understand even to a novice starting for the first time, and that it is completely stuffed with useful examples. I am going to buy this book -- you just wait!

I bought this book to gain a practical understanding of Fourier Transforms and how to implement them with real data. I already had a conceptual understanding of FTs but not a practical one to where I could use them. This book bridged that gap for me and it seems as though that was among the author's intentions were when he wrote it. I would recommend this book and its companion to anyone in the same position.

I needed to learn some basics about the DFT and FFT. "Understanding the FFT" seemed to be loaded with computer programs. I found very little to help me learn the concepts. "Who Is Fourier? A Mathematical Adventure" by the Transnational College of Lex and "Introduction to Fourier Analysis" by Norman Morrison where the books that helped me the most.

This book contains all the necessary info to obtain a working knowledge of DFT and FFT. It contains many GWBASIC example programs so the reader can get a good grasp of what the algorithms are supposed to do. "C" progammers would have no difficulty rewitting these algorithms in "C".
Notes:
(1) most GWBASIC programs run without modification under QBASIC.
(2) the ones that don't run under QBASIC contain graphics statements and are easily fixed using QBASIC help.
(3) if you hate to enter source code, the software is available on diskette from the publisher for a small fee ...(includes GWBASIC and QBASIC examples)
(4) I've discovered "BASIC programmer" web sites where both GWBASIC and QBASIC are available for free download.

I borrowed this book from library to revise all the things I studied but had forgotten. However I must say it was very disappointing. It is certainly not a good book, it is written in a way difficult to understand, it lacks explanations on several topics, there are too many problems but no solutions, etc etc.

This book is a very useful one, if not a must.

I am interasted in all aspects of algorithms and methods VLSI design automation

Searching through the items I have purchased here at Amazon in the past I came upon a disturbing site: Someone had rated this book with 2 stars and claimed to be "interested in all aspects of algorithms and methods VLSI design automation". As you may see from below 13 out of 13 costumers ( I will be the 14th) seem to disagree or not find his comments all to helpful. I have rated this book with 5 starts in part to counteract this guy's horrible judgment and in part to make justice to a very well written book. At least that's what I thought after I first read it (during my sophomore year of college) after having finished an introduction course in Digital Design. What was nice about this book at the time was that it reinforced the basic concepts that my introductory course had left kind of hanging. This book is for the more mathematically inclined Computer Science or Electrical and Computer Engineering majors who want a more profound insight to digital design from small to large to very large integration. If you thought that just because it's a more theoretically oriented book it doesn't also provide good example you were of course wrong. There is a sizeable number of examples and best of all pseudo code of the algorithms which are explained here.
I hope this ACTUALLY helps

Although we are indeed in a great need for a practitioner oriented cookbook with algorithms dealing with less common graph problems, this book is not the answer. The book contains mostly just fairly common algorithms. For me personally only the algorithms solving connectivity problems, like the 1.6 "Minimal Equivalent Graph," have a rarity value and would really help me saving time for my own research and development.

The biggest drawback of this book is it's typography. The algorithms are all written in FORTRAN. Unless you want to learn, or to refresh the all-capitol-letter type style, with labels in columns 1-5 and goto statements, you will not have much use of this book. According to the signature, the book is a 1989 edition. This would make it almost contemporary. But the coding presented in this book resembles the "usual and customary" of the 1965--1975 period.

The book has sure has a collection value, though, and I like to have it on my shelve.

Graph theory is always an active area of mathematics research - especially the search for efficient algorithms. Although many well-developed procedures have appeared in various books and journals, ready-to-use computer code has never been available in one easily accessible resource. Algorithms on Graphs provides a ready source of plug-in code for some of the most interesting and useful algorithms yet developed. It is a unique resource designed for the busy professional - a resource that you will want to keep close at hand every day, featuring a library of computer programs dealing with the mathematical principles of: Connectivity, Shortest paths, Traversability, Node Coloring, Minimum Spanning Tree, Maximum Cardinality Matching, and Planarity Testing All programs are complete and ready to use.

Computing Patterns in Strings by B. Smyth is a very useful book. String algorithms is a separate discipline in Europe (France, UK, Italy etc.) and in many other places in the world. However, in North America, this is not the case and the research and the results are scattered among many disciplines and many books. Thus most significant books on the topics concerning string algorithms are not of North American provenance. Smyth's book provide the reader with a comprehensive up-to-date overview of the discipline, rather than covering a few topics. The author exhibits a witty and readable style and, except for a few errors one always has to expect in a book covering so many algorithms and a well-founded reader can easily spot and disregard, the book is an excellent introduction to the discipline. I can highly recommend it to anyone seriously considering extending his/her knowledge of computer science. I certainly enjoyed it.

If you are looking for a dry, obscure, pedantic monograph that uses cryptic hieroglyphics to describe algorithms, well, friend, this text is for you! On the other hand, if you are looking for a practical text that can be read by non-Math majors, move on. THERE IS ZERO USEABLE MATERIAL that I was able to glean from the book, and I've been programming commercial search engines and parsers for 9 years.

I have no doubt that the author knows what he's talking about, but the information is, for all practical purposes, encrypted and I don't have the keys.

And the quotes from dead Romans and literary figures that are on most pages are just pretentious, distracting, and annoying.

I'd love to get my money back.

Rather than waste money on this book, it is better to read original papers for the purpose of getting accurate ideas and concepts.

I will recommend this book for all those who are interested in knowing the
state of the art in the subject of curve and surface reconstruction. Curve
and surface reconstruction from point cloud is not an easy problem and over
the years a significant amount of research is done on this subject. This book
is where you get it all together.

It starts with compiling all the mathematical constructs and concepts one need
to understand before getting into this subject in more details. This book treats
the subject in a nice order in the sense it starts with curve reconstruction
algorithms, surface reconstruction algorithms, ways to deal with undersampling,
producing water tight surface, and dealing with noisy data. This is in a way
the order the subject has developed over the years. It treats the mathematics
behind the algorithm very well. Though at some places mathematical rigor is
maintained but the intuition is also very clear.

In general, I like monograph like these because they are very handy and
useful for references. I do not have to scramble through papers all the time
to find a result or an algorithm. I once again recommend highly of this book.

Some one who wants to beagin with DE. This the good starting point. Book started with good conceptual backgroud and carried away with codeing details of DE. Kenneth puts enough efforts to clear concept behind DE. Only thing missing is that book demands little background with GAs, EAs and optimization theory.Other wise nice book for those who are familiarized with concept of evolutionary techniques.

I bought the book simply because the authors are the original developers of the algorithm, and hope to get some more information than what I learned from the literature (isolated individual publications over the years).

I am a little disappointed, and feeling regretted spending nearly $70 on this book. That said, though, I would like to give a 3.75 stars if amazon allows me to do so.

In general, the English seems not very well polished sometimes could hinder the understanding. The code can be used to help understand the algorithm but be warned, they might not be amenable for direct use in any serious software development.

I spend more than 3 days reading the book but I feel what I got from the book is not even comparable to what I learned in just 1 hours from for example the following paper
Jouni Lampinen and Ivan Zelinka, "Mixed Variable Non-linear Optimization By Differential Evolution". The paper gives very clear and concise description of DE. (The author of the paper was the last author of the book).

Finally, it is my opinion that: if you are completely new to Differential Evolution, it is not advisable to spend any money on this book. You would easily get lost by the overwhelming implementation details. For the purpose of learning Differential Evolution, relevant papers, wikipedia, or visiting various links on the subject would help you even better learn the algorithm. As a matter of fact (at least to me) the original papers by these authors are far more better (in terms of conciseness and clarity) and accessible than what they cook in this book.

However, if you already have some exposure to Differential Evolution,but would like to know the specific implementation details or more in-depth theoretical discussions, the book can provide something more, especially regarding the implementation details such as initialization, crossover, scaling factor etc that not readily available (or omitted) from isolated publications.

For the exprienced image processing engineer few books offer such a treasure of methods.

Yaroslavsky has a life time experience developing image processing systems, and it is very evident in the book. The book is full of very practical methods and is very conscious to computational burden.

Some of the chapters, such as the ones covering nonlinear filters, interpolation and resampling, and fast algorithms for base transforms contributed immensely to the way I think today as an image processing engineer.

The book's english is hard to read, and its technical language and notations are very different from most of the related literature, but the patience was very worthwhile for me.

Leaving aside Kluwer's editorial work, this is probably one of the most important books on image processing. This is the book that I find myself returning to again and again, collecting nrw insights at each time.

The author provides a rigorous mathematical formulation for the fundamental problems in image processing: quantization, object detection, restoration, etc.
Based on this formulation, efficient algorithms are derived and a their performance is mathematically analyzed.
Than a disscussion follows which sheds new light on other approaches and ties them together into one big picture. For example: wavelet shrinkage, wiener filters and PCA are tied together in the context of image enhancement.

I recommend this book to anyone who wants to be an image processing expert.

This book contains useful formulas and derivations which may not be in other books, but the English is awful. It also has some significant technical mistakes in some equations. I can't believe Kluwer published this. Quoting from page 7, "In real application, it very frequently happens . Very that noise randomly replaces signal values that in this case are completely lost. In such situation, in general, the model of impulse noise is used." If I were Kluwer, I'd do a product recall, edit the book and release it under a different title.

I have owned this book for 10 years now and have used it more as a reference than anything else. The authors tend to go a little overboard in trying to present the material as a mathematics subject. But once you get used to their notation (very computer science oriented not electrical engineering)the information they give in the alogrithm portion (last chapters) is hard to find anywhere else. I actually implemented the non-restoring integer divder and FIFO described in the text in several digital ASICs I have designed. If you're a professional logic designer or graduate student I recommend this book if you can pick it up cheap used. The binding on this book is very weak. I need to find some duct tape...

I'm a professional logic designer and even I found some of the material in this text to be very challenging to follow. I use it more as a reference. The book focuses only on synchronous logic circuits. It is fairly standard on combinatorial networks and statemachines. However, like the book's title suggets, the final sections on h/w logic algorithms (multipliers, dividers, FIFOs, bit-slice processors, etc.) and their implementation can be useful to any practicing design engineer or graduate student.