Arrangements of curves in the plane- topology, combinatorics, and algorithms (1988)

Arrangements of curves in the plane- topology, combinatorics, and algorithms (1988)
~
Edelsbrunner, Herbert; Pach, Janos; Pollack, Richard; Sharir, Micha

Publisher: New York: Courant Institute of Mathematical Sciences, New York University
Possible copyright status: NOT_IN_COPYRIGHT
Language: English
Call number: 13602251
Digitizing sponsor: Sloan Foundation
Book contributor: New York University, Institute of Fine Arts Library

Download here

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Algorithmic Bioprocesses (Natural Computing Series)

Algorithmic Bioprocesses (Natural Computing Series)
~
Anne Condon (Editor), David Harel (Editor), Joost N. Kok (Editor), Arto Salomaa (Editor), Erik Winfree (Editor)

Product Description

A fundamental understanding of algorithmic bioprocesses is key to learning how information processing occurs in nature at the cell level. The field is concerned with the interactions between computer science on the one hand and biology, chemistry, and DNA-oriented nanoscience on the other. In particular, this book offers a comprehensive overview of research into algorithmic self-assembly, RNA folding, the algorithmic foundations for biochemical reactions, and the algorithmic nature of developmental processes.

The editors of the book invited 36 chapters, written by the leading researchers in this area, and their contributions include detailed tutorials on the main topics, surveys of the state of the art in research, experimental results, and discussions of specific research goals. The main subjects addressed are sequence discovery, generation, and analysis; nanoconstructions and self-assembly; membrane computing; formal models and analysis; process calculi and automata; biochemical reactions; and other topics from natural computing, including molecular evolution, regulation of gene expression, light-based computing, cellular automata, realistic modelling of biological systems, and evolutionary computing.

This subject is inherently interdisciplinary, and this book will be of value to researchers in computer science and biology who study the impact of the exciting mutual interaction between our understanding of bioprocesses and our understanding of computation.


About the Author

The editors and contributors include most of the key researchers working on these topics worldwide.
Product Details

* Hardcover: 742 pages
* Publisher: Springer; 1 edition (October 7, 2009)
* Language: English
* ISBN-10: 3540888683
* ISBN-13: 978-3540888680

Download here

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Spoken Language Processing: A Guide to Theory, Algorithm and System Development

Spoken Language Processing: A Guide to Theory, Algorithm and System Development
~
Alex Acero (Author), Hsiao-Wuen Hon (Author)

Product Description
Offers coverage of new advances in spoken language processing in computer science, drawing on the most recent discoveries in computer science, electrical engineering, mathematics, and other fields. Covers speech recognition, speech processing, spoken language understanding, speech synthesis, and speech interface design. DLC: Natural language processing (Computer science).


From the Inside Flap
Preface

Our primary motivation in writing this book is to share our working experience to bridge the gap between the knowledge of industry gurus and newcomers to the spoken language processing community. Many powerful techniques hide in conference proceedings and academic papers for years before becoming widely recognized by the research community or the industry. We spent many years pursuing spoken language technology research at Carnegie Mellon University before we started spoken language R&D at Microsoft. We fully understand that it is by no means a small undertaking to transfer a state-of-the-art spoken language research system into a commercially viable product that can truly help people improve their productivity. Our experience in both industry and academia is reflected in the context of this book, which presents a contemporary and comprehensive description of both theoretic and practical issues in spoken language processing. This book is intended for people of diverse academic and practical backgrounds. Speech scientists, computer scientists, linguists, engineers, physicists, and psychologists all have a unique perspective on spoken language processing. This book will be useful to all of these special interest groups.

Spoken language processing is a diverse subject that relies on knowledge of many levels, including acoustics, phonology, phonetics, linguistics, semantics, pragmatics, and discourse. The diverse nature of spoken language processing requires knowledge in computer science, electrical engineering, mathematics, syntax, and psychology. There are a number of excellent books on the subfields of spoken language processing, including speech recognition, text-to-speech conversion, and spoken language understanding, but there is no single book that covers both theoretical and practical aspects of these subfields and spoken language interface design. We devote many chapters systematically introducing fundamental theories needed to understand how speech recognition, text-to-speech synthesis, and spoken language understanding work. Even more important is the fact that the book highlights what works well in practice, which is invaluable if you want to build a practical speech recognizer, a practical text-to-speech synthesizer, or a practical spoken language system. Using numerous real examples in developing Microsoft's spoken language systems, we concentrate on showing how the fundamental theories can be applied to solve real problems in spoken language processing.
# Paperback: 1008 pages
# Publisher: Prentice Hall PTR (May 5, 2001)
# Language: English
# ISBN-10: 0130226165
# ISBN-13: 978-0130226167

Download here

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

A History of Algorithms: From the Pebble to the Microchip

A History of Algorithms: From the Pebble to the Microchip
~
Jean-Luc Chabert (Editor), C. Weeks (Translator), E. Barbin (Contributor), J. Borowczyk (Contributor), J.-L. Chabert (Contributor), M. Guillemot (Contributor), A. Michel-Pajus (Contributor), A. Djebbar (Contributor), J.-C. Martzloff (Contributor)

Product Description
A Source Book for the History of Mathematics, but one which offers a different perspective by focusinng on algorithms. With the development of computing has come an awakening of interest in algorithms. Often neglected by historians and modern scientists, more concerned with the nature of concepts, algorithmic procedures turn out to have been instrumental in the development of fundamental ideas: practice led to theory just as much as the other way round. The purpose of this book is to offer a historical background to contemporary algorithmic practice.


Language Notes
Text: English (translation)
Original Language: French
Product Details

* Paperback: 524 pages
* Publisher: Springer; 1 edition (August 1, 1999)
* Language: English
* ISBN-10: 3540633693
* ISBN-13: 978-3540633693

Download here

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Algorithms for computer algebra

Algorithms for computer algebra
~
Keith O. Geddes, Stephen R. Czapor, and George Labahn

eview
`The Computer Algebra community has been waiting for years for this book to appear. ...the book is a masterpiece and can be recommended to everyone interested in the algorithms for computer algebra, either as a reference for further research or just to give the casual user an idea why things work as good (or as bad) as they do in computer algebra packages. ...the recommendation would be clear: Buy this book! As it stands now my only advice is to stay away from this book, because you might be tempted to buy it anyway (at least I was).' Computer Algebra Nederland Newsletter, June 1993


Product Description
Algorithms for Computer Algebra is the first comprehensive textbook to be published on the topic of computational symbolic mathematics. The book first develops the foundational material from modern algebra that is required for subsequent topics. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Numerous examples are integrated into the text as an aid to understanding the mathematical development. The algorithms developed for each topic are presented in a Pascal-like computer language. An extensive set of exercises is presented at the end of each chapter. Algorithms for Computer Algebra is suitable for use as a textbook for a course on algebraic algorithms at the third-year, fourth-year, or graduate level. Although the mathematical development uses concepts from modern algebra, the book is self-contained in the sense that a one-term undergraduate course introducing students to rings and fields is the only prerequisite assumed. The book also serves well as a supplementary textbook for a traditional modern algebra course, by presenting concrete applications to motivate the understanding of the theory of rings and fields.
Product Details

* Hardcover: 608 pages
* Publisher: Springer; 1 edition (September 30, 1992)
* Language: English
* ISBN-10: 0792392590
* ISBN-13: 978-0792392590

Download here

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

An introduction to computer graphics and creative 3-D environments

An introduction to computer graphics and creative 3-D environments
~
Blundell B.

Product Description

This book introduces the fundamentals of 2-D and 3-D computer graphics. Additionally, a range of emerging, creative 3-D display technologies are described, including stereoscopic systems, immersive virtual reality, volumetric, varifocal, and others.

Interaction is a vital aspect of modern computer graphics, and issues concerning interaction (including haptic feedback) are discussed. Included with the book are anaglyph, stereoscopic, and Pulfrich viewing glasses. Topics covered include: - essential mathematics, - vital 2-D and 3-D graphics techniques, - key features of the graphics, - pipeline, - display and interaction techniques, - important historical milestones.

Designed to be a core teaching text at the undergraduate level, accessible to students with wide-ranging backgrounds, only an elementary grounding in mathematics is assumed as key maths is provided. Regular âOver to Youâ activities are included, and each chapter concludes with review and discussion questions.
Product Details

* Hardcover: 480 pages
* Publisher: Springer; 1 edition (September 12, 2008)
* Language: English
* ISBN-10: 1848000413
* ISBN-13: 978-1848000414

Download here

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Computational geometry - Methods, algorithms and applications

Computational geometry - Methods, algorithms and applications
~
Bieri H., Noltemeier H. (eds.)

Product Description
This volume presents the proceedings of the Seventh International Workshop on Computational Geometry, CG'91, held at the University of Berne, Switzerland, March 21/22, 1991. Computational geometry is not a precisely defined field. Often, it is understood as a nearly mathematical discipline, dealing mainly with complexity questions concerning geometrical problems and algorithms. But often too, and perhaps increasingly, questions of more practical relevance are central, such as applicability, numerical behavior and performance for all kinds of input size. Topics considered in CG'91 include: - Generalizations and applications of the Voronoi diagram - Problems with rectangular objects - Path determination - Moving objects - Visibility questions - Layout problems - Representation of spatial objects and spatial queries - Problems in higher dimensions - Implementation questions - Relations to artificial intelligence.
Product Details

* Paperback: 320 pages
* Publisher: Springer; 1 edition (December 13, 1991)
* Language: English
* ISBN-10: 3540548912
* ISBN-13: 978-3540548911

Download here

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Introduction to Parallel Processing: Algorithms and Architectures (Series in Computer Science)

Introduction to Parallel Processing: Algorithms and Architectures (Series in Computer Science)
~
Parhami B.

Product Description
This original text provides comprehensive coverage of parallel algorithms and architectures, beginning with fundamental concepts and continuing through architectural variations and aspects of implementation. Unlike the authors of similar texts, Professor Parhami reviews the circuit model and problemdriven parallel machines, variants of mesh architectures, and composite and hierarchical systems, among other subjects. With its balanced treatment of theory and practical designs, classtested lecture material and problems, and helpful case studies, the book is suited to graduate and upperlevel undergraduate students of advanced architecture or parallel processing.
Product Details

* Hardcover: 556 pages
* Publisher: Springer; 1 edition (January 31, 1999)
* Language: English
* ISBN-10: 0306459701
* ISBN-13: 978-0306459702

Download

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings (Lecture Notes in Computer ... / Programming and Software Engineering)

Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings (Lecture Notes in Computer ... / Programming and Software Engineering)
~
Sotiris E. Nikoletseas (Editor)

Product Description
This book constitutes the refereed proceedings of the 4th International Workshop on Experimental and Efficient Algorithms, WEA 2005, held in Santorini Island, Greece in May 2005. The 47 revised full papers and 7 revised short papers presented together with extended abstracts of 3 invited talks were carefully reviewed and selected from 176 submissions. The book is devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, scheduling, searching, sorting, string matching, coding, networking, data mining, data analysis, etc.
Product Details

* Paperback: 624 pages
* Publisher: Springer; 1 edition (June 23, 2005)
* Language: English
* ISBN-10: 3540259201
* ISBN-13: 978-3540259206

Download

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Computer Arithmetic and Validity: Theory, Implementation, and Applications (De Gruyter Studies in Mathematics)

Computer Arithmetic and Validity: Theory, Implementation, and Applications (De Gruyter Studies in Mathematics)
~
Kulisch (Author), Ulrich (Author)

Product Description
The present book deals with the theory of computer arithmetic, its implementation on digital computers and applications in applied mathematics to compute highly accurate and mathematically verified results. The aim is to improve the accuracy of numerical computing (by implementing advanced computer arithmetic) and to control the quality of the computed results (validity). The book can be useful as high-level undergraduate textbook but also as reference work for scientists researching computer arithmetic and applied mathematics.


About the Author
Ulrich Kulisch, University Karlsruhe.
Product Details

* Hardcover: 410 pages
* Publisher: Walter de Gruyter; 1 edition (May 20, 2008)
* Language: English
* ISBN-10: 3110203189
* ISBN-13: 978-3110203189

Download

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Encyclopedia of Algorithms

Encyclopedia of Algorithms
~
Ming-Yang Kao (Editor)

Product Description

The Encyclopedia of Algorithms will provide a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. The first edition of the reference will focus on high-impact solutions from the most recent decade; later editions will widen the scope of the work.

Nearly 500 entries will be organized alphabetically by problem, with subentries allowing for distinct solutions and special cases to be listed by the year. An entry will include: a description of the basic algorithmic problem; the input and output specifications; the key results; examples of applications; citations to the key literature.

Open problems, links to downloadable code, experimental results, data sets, and illustrations may be provided. All entries will be written by experts with links to Internet sites that outline their research work will be provided. The entries will be peer-reviewed.

This defining reference will be published in print and on line. The print publication will include an index of subjects and authors as well as a chronology for locating recent solutions. The online edition will supplement this index with hyperlinks as well as include hyperlinks in the text of the entries to related entries, xRefer citations, and other useful URLs mentioned above.
# Hardcover: 1166 pages
# Publisher: Springer; 1 edition (August 27, 2008)
# Language: English
# ISBN-10: 0387360611
# ISBN-13: 978-0387360614

Download

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Data Structures and Algorithms in C++

Data Structures and Algorithms in C++
~
Drozdek A.

Editorial Reviews
Product Description
Using C++, author Adam Drozdek highlights three important aspects of data structures and algorithms. First, the book places special emphasis on the connection between data structures and their algorithms, including an analysis of the algorithms' complexity. Second, the book presents data structures in the context of object-oriented program design, stressing the principle of information hiding in its treatment of encapsulation and decomposition. Finally, the book closely examines data structure implementation. Overall, this practical and theoretical book prepares students with a solid foundation in data structures for future courses and work in design implementation, testing, or maintenance of virtually any software system.


About the Author
Adam Drozdek is Associate Professor of Computer Science at Duquesne University.
Product Details

* Hardcover: 776 pages
* Publisher: Course Technology; 3 edition (September 24, 2004)
* Language: English
* ISBN-10: 0534491820
* ISBN-13: 978-0534491826

Download

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Speech Coding Algorithms: Foundation and Evolution of Standardized Coders

Speech Coding Algorithms: Foundation and Evolution of Standardized Coders
~
Chu.

Review
“…well equipped with exercises and with procedures which are helpful in implementing the coders…” (Zentralblatt Math, Vol.1041, No.16, 2004)


Product Description
* Speech coding is a highly mature branch of signal processing deployed in products such as cellular phones, communication devices, and more recently, voice over internet protocol
* This book collects many of the techniques used in speech coding and presents them in an accessible fashion
* Emphasizes the foundation and evolution of standardized speech coders, covering standards from 1984 to the present
* The theory behind the applications is thoroughly analyzed and proved
# Hardcover: 592 pages
# Publisher: Wiley-Interscience; 1st edition (March 7, 2003)
# Language: English
# ISBN-10: 0471373125
# ISBN-13: 978-0471373124

Download

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Advanced Data Structures

Advanced Data Structures
~
Brass P.

Editorial Reviews
Product Description
Advanced Data Structures presents a comprehensive look at the ideas, analysis, and implementation details of data structures as a specialized topic in applied algorithms. Data structures are how data is stored within a computer, and how one can go about searching for data within. This text examines efficient ways to search and update sets of numbers, intervals, or strings by various data structures, such as search trees, structures for sets of intervals or piece-wise constant functions, orthogonal range search structures, heaps, union-find structures, dynamization and persistence of structures, structures for strings, and hash tables. This is the first volume to show data structures as a crucial algorithmic topic, rather than relegating them as trivial material used to illustrate object-oriented programming methodology, filling a void in the ever-increasing computer science market. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text. topic. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text.


Book Description
Advanced Data Structures presents a comprehensive look at the implementation and analysis of data structures as a specialized topic in applied algorithms. This graduate-level textbook examines efficient ways to realize query operations and the history of various structures as they are related to basic concepts of data storage.
See all Editorial Reviews
Product Details

* Hardcover: 472 pages
* Publisher: Cambridge University Press; 1 edition (September 8, 2008)
* Language: English
* ISBN-10: 0521880378
* ISBN-13: 978-0521880374

Download

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Network Analysis: Methodological Foundations (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues)

Network Analysis: Methodological Foundations (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues)
~
Brandes U., Erlebach T. (eds.)

Product Description

‘Network’ is a heavily overloaded term, so that ‘network analysis’ means different things to different people. Specific forms of network analysis are used in the study of diverse structures such as the Internet, interlocking directorates, transportation systems, epidemic spreading, metabolic pathways, the Web graph, electrical circuits, project plans, and so on. There is, however, a broad methodological foundation which is quickly becoming a prerequisite for researchers and practitioners working with network models.

From a computer science perspective, network analysis is applied graph theory. Unlike standard graph theory books, the content of this book is organized according to methods for specific levels of analysis (element, group, network) rather than abstract concepts like paths, matchings, or spanning subgraphs. Its topics therefore range from vertex centrality to graph clustering and the evolution of scale-free networks.

In 15 coherent chapters, this monograph-like tutorial book introduces and surveys the concepts and methods that drive network analysis, and is thus the first book to do so from a methodological perspective independent of specific application areas.

Product Details

* Paperback: 472 pages
* Publisher: Springer; 1 edition (March 24, 2005)
* Language: English
* ISBN-10: 3540249796
* ISBN-13: 978-3540249795

Download

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Object-Oriented Analysis and Design with Applications

Object-Oriented Analysis and Design with Applications
~
Booch G., et al.

Amazon.com Review
In this eagerly awaited second edition, Grady Booch draws upon the rich and varied results of those projects and offers improved methods for object development and a new, unified notation. With numerous examples implemented in C++, Booch illustrates essential concepts, explains the method, and shows successful applications in a variety of fields. Booch also gives pragmatic advice on a host of issues, including classification, implementation strategies, and cost-effective project management. A two-time winner of Software Development's coveted Jolt Cola Product Excellence Award! --This text refers to an alternate Hardcover edition.


Product Description

Object-Oriented Design with Applications has long been the essential reference to object-oriented technology, which, in turn, has evolved to join the mainstream of industrial-strength software development. In this third edition--the first revision in 13 years--readers can learn to apply object-oriented methods using new paradigms such as Java, the Unified Modeling Language (UML) 2.0, and .NET.

The authors draw upon their rich and varied experience to offer improved methods for object development and numerous examples that tackle the complex problems faced by software engineers, including systems architecture, data acquisition, cryptoanalysis, control systems, and Web development. They illustrate essential concepts, explain the method, and show successful applications in a variety of fields. You'll also find pragmatic advice on a host of issues, including classification, implementation strategies, and cost-effective project management.

New to this new edition are

* An introduction to the new UML 2.0, from the notation's most fundamental and advanced elements with an emphasis on key changes
* New domains and contexts
* A greatly enhanced focus on modeling--as eagerly requested by readers--with five chapters that each delve into one phase of the overall development lifecycle.
* Fresh approaches to reasoning about complex systems
* An examination of the conceptual foundation of the widely misunderstood fundamental elements of the object model, such as abstraction, encapsulation, modularity, and hierarchy
* How to allocate the resources of a team of developers and mange the risks associated with developing complex software systems
* An appendix on object-oriented programming languages

This is the seminal text for anyone who wishes to use object-oriented technology to manage the complexity inherent in many kinds of systems.


Sidebars
Preface
Acknowledgments
About the Authors
Section I: Concepts
Chapter 1: Complexity
Chapter 2: The Object Model
Chapter 3: Classes and Objects
Chapter 4: Classification
Section II: Method
Chapter 5: Notation
Chapter 6: Process
Chapter 7: Pragmatics
Chapter 8: System Architecture: Satellite-Based Navigation
Chapter 9: Control System: Traffic Management
Chapter 10: Artificial Intelligence: Cryptanalysis
Chapter 11: Data Acquisition: Weather Monitoring Station
Chapter 12: Web Application: Vacation Tracking System
Appendix A: Object-Oriented Programming Languages
Appendix B: Further Reading
Notes
Glossary
Classified Bibliography
Index
Product Details

* Hardcover: 720 pages
* Publisher: Addison-Wesley Professional; 3 edition (April 30, 2007)
* Language: English
* ISBN-10: 020189551X
* ISBN-13: 978-0201895513

Download

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Understanding Search Engines: Mathematical Modeling and Text Retrieval (Software, Environments, Tools)

Understanding Search Engines: Mathematical Modeling and Text Retrieval (Software, Environments, Tools)
~
Berry M.W., Browne M.

Review
‘There is no other information retrieval/search book where the heart is the mathematical foundations. This book is greatly needed to further establish information retrieval as a serious academic, as well as practical and industrial, area.’ Jaime Carbonell, Carnegie Mellon University

‘Berry and Browne describe most of what you need to know to design your own search engine. Their strength is the description of the solid mathematical underpinnings at a level that is understandable to competent engineering undergraduates, perhaps with a bit of instructor guidance. They discuss the algorithms used by most commercial search engines, so you may find your use of Google and its kind becomes more effective, too.’ George Corliss, Marquette University.

‘This book gives a valuable, generally non-technical, insight into how search engines work, how to improve the users' success in Information Retrieval (IR), and an in-depth analysis of a mathematical algorithm for improving a search engine's performance. …Written in an informal style, the book is easy to read and is a good introduction on how search engines operate…’ Christopher Dean, Mathematics Today

‘Anyone interested in building their own search engine, or looking for a compact and readable introduction to the field of modern information retrieval will find this book to be an excellent first introduction.’ Tony Donaldson, MAA Reviews
See all Editorial Reviews
Product Details

* Paperback: 117 pages
* Publisher: SIAM, Society for Industrial and Applied Mathematics; 2 edition (April 28, 2005)
* Language: English
* ISBN-10: 0898715814
* ISBN-13: 978-0898715811

Download

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Advances in Greedy Algorithms

Advances in Greedy Algorithms
~
Witold Bednorz

The greedy algorithm is one of the simplest approaches to solve the optizmization problem in which we want to determine the global optimum of a given function by a sequence of steps where at each stage we can make a choice among a class of possible decisions. In the greedy method the choice of the optimal decision is made on the information at hand without worrying about the effect these decisions may have in the future. Greedy algorithms are easy to invent, easy to implement and most of the time quite efficient. However there are many problems that cannot be solved correctly by the greedy approach. The common example of the greedy concept is the problem of ‘Making Change’ in which we want to make a change of a given amount using the minimum number of US coins. We can use five different values: dollars (100 cents), quarters (25 cents), dimes (10 cents), nickels (5 cents) and pennies (1 cent). The greedy algorithm is to take the largest possible amount of coins of a given value starting from the highest one (100 cents). It is easy to see that the greedy strategy is optimal in this setting, indeed for proving this it suffices to use the induction principle which works well because in each step either the procedure has ended or there is at least one coin we can use of the actual value. It means that the problem has a certain optimal substructure, which makes the greedy algorithm effective. However a slight modification of ‘Making Change’, e.g. where one value is missing, may turn the greedy strategy to be the worst choice. Therefore there are obvious limits for using the greedy method: whenever there is no optimal substructure of the problem we cannot hope
that the greedy algorithm will work. On the other hand there is a lot of problems where the greedy strategy works unexpectedly well and the purpose of this book is to communicate various results in this area. The key point is the simplicity of the approach which makes the greedy algorithm a natural first choice to analyze the given problem. In this book there are discussed several algorithmic questions in: biology, combinatorics, networking, scheduling
or even pure mathematics, where the greedy algorithm can be used to produce the optimal or nearly optimal answer.
The book was written in 2008 by the numerous authors who contributed the publication by presenting their researches in a form of a self-contained chapters. The idea was to coordinate the international project where specialists all over the world can share their knowledge on the greedy algorithms theory. Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by author(s). Usually some elementary knowledge is assumed, yet all the required facts are quoted mostly in examples, remarks or theorems. The publication may be useful for all graduates and undergraduates interested in
the algorithmic theory with the focus on the greedy approach and applications of this method to various concrete examples. Most of scientists involved in the project are young at the full strength of their career, hence the presented content is fresh and acquaints with the new directions where the theory of greedy algorithms evolves to.

Download

Science, mathematics, physics,chemistry, informatics, etc..

www.mathlib.org

Read more...

Introduction to Algorithms, 2nd Edition

Introduction to Algorithms, 2nd Edition
by: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein

Details

# Hardcover: 1184 pages
# Publisher: The MIT Press; 2nd edition (September 1, 2001)
# Language: English
# ISBN-10: 0262032937
# ISBN-13: 978-0262032933

Description

There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.

Download

http://ifile.it/xq7mpf/ebc_introduction_to_algorithms_2ed_-_instructors_manual.rar
http://www.mediafire.com/?6ewxudcigel

Read more...

Algorithms in a Nutshell (In a Nutshell (O'Reilly))

Algorithms in a Nutshell (In a Nutshell (O'Reilly))
by: George Heineman, Gary Pollice, Stanley Selkow

Details

# Paperback: 362 pages
# Publisher: O'Reilly Media; illustrated edition edition (October 21, 2008)
# Language: English
# ISBN-10: 059651624X
# ISBN-13: 978-0596516246

Description

Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm for your needs -- with just enough math to let you understand and analyze algorithm performance.

With its focus on application, rather than theory, this book provides efficient code solutions in several programming languages that you can easily adapt to a specific project. Each major algorithm is presented in the style of a design pattern that includes information to help you understand why and when the algorithm is appropriate.

With this book, you will:

* Solve a particular coding problem or improve on the performance of an existing solution
* Quickly locate algorithms that relate to the problems you want to solve, and determine why a particular algorithm is the right one to use
* Get algorithmic solutions in C, C++, Java, and Ruby with implementation tips
* Learn the expected performance of an algorithm, and the conditions it needs to perform at its best
* Discover the impact that similar design decisions have on different algorithms
* Learn advanced data structures to improve the efficiency of algorithms

With Algorithms in a Nutshell, you'll learn how to improve the performance of key algorithms essential for the success of your software applications.

Download

http://rapidshare.com/files/197028684/059651624X.rar

Read more...