Home | Amazing | Today | Tags | Publishers | Years | Account | Search 
Combinatorial Methods with Computer Applications (Discrete Mathematics and Its Applications)
Combinatorial Methods with Computer Applications (Discrete Mathematics and Its Applications)

Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the...

Geometric Algorithms and Combinatorial Optimization (Algorithms and Combinatorics 2)
Geometric Algorithms and Combinatorial Optimization (Algorithms and Combinatorics 2)

This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and - in particular - combinatorial optimization. It offers a unifying approach based on two fundamental geometric algorithms: - the ellipsoid method for finding a point in a convex set and - the basis reduction...

Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science)
Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science)

This thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members, What general methods are useful for listing combinatorial...

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications (Operations Research / Computer Science Interfaces Series)
Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications (Operations Research / Computer Science Interfaces Series)

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. The book contains eleven chapters written by...

Discrete Geometry for Computer Imagery: 16th IAPR International Conference, DGCI 2011, Nancy, France
Discrete Geometry for Computer Imagery: 16th IAPR International Conference, DGCI 2011, Nancy, France
The 16th edition of the International Conference on Discrete Geometry for Computer Imagery was held in Nancy, France, April 6–8, 2011, and was organized by the ADAGIo team of the LORIA laboratory (Lorraine research center in computer science and its applications). DGCI 2011 attracted many researchers from all around the...
Handbook of Mathematical Models in Computer Vision
Handbook of Mathematical Models in Computer Vision
David Marr's theory was a pioneering step towards understanding visual perception.
In his view human vision was based on a complete surface reconstruction
of the environment that was then used to address visual subtasks. This approach
was proven to be insufficient by neuro-biologists and complementary ideas from
statistical
...
Effective Computational Geometry for Curves and Surfaces (Mathematics and Visualization)
Effective Computational Geometry for Curves and Surfaces (Mathematics and Visualization)

This book covers combinatorial data structures and algorithms, algebraic issues in geometric computing, approximation of curves and surfaces, and computational topology. Each chapter fully details and provides a tutorial introduction to important concepts and results. The focus is on methods which are both well founded mathematically and...

Geometric Problems on Maxima and Minima
Geometric Problems on Maxima and Minima
Questions of maxima and minima have great practical significance, with applications to physics, engineering, and economics; they have also given rise to theoretical advances, notably in calculus and optimization. Indeed, while most texts view the study of extrema within the context of calculus, this carefully constructed problem book takes a...
Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations
Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations
This seminal, much-cited account begins with a fairly elementary exposition of basic concepts and a discussion of factor groups and subgroups. The topics of Nielsen transformations, free and amalgamated products, and commutator calculus receive detailed treatment. The concluding chapter surveys word, conjugacy, and related problems; adjunction...
A Combinatorial Introduction to Topology
A Combinatorial Introduction to Topology
Topology is remarkable for its contributions to the popular culture of mathematics. Euler's formula for polyhedra, the four color theorem, the Mobius strip, the Klein bottle, and the general notion of a rubber sheet geometry are all part of the folklore of current mathematics. The student in a first course in topology, however, must often wonder...
Boolean Functions in Cryptology and Information Security (Nato Science for Peace and Security)
Boolean Functions in Cryptology and Information Security (Nato Science for Peace and Security)
This book contains the proceedings of the NATO-Russia Advanced Study Institute (ASI) 'Boolean Functions in Cryptology and Information Security', which was held in Zvenigorod, Moscow region, Russia. These proceedings consist of three parts. The first part contains survey lectures on various areas of Boolean function theory that are of primary...
Ramsey Theory for Discrete Structures
Ramsey Theory for Discrete Structures

This monograph covers some of the most important developments in Ramsey theory from its beginnings in the early 20th century via its many breakthroughs to recent important developments in the early 21st century.

The book first presents a detailed discussion of the roots of Ramsey theory before offering a thorough discussion of the...

Result Page: 11 10 9 8 7 6 5 4 3 2 
©2018 LearnIT (support@pdfchm.net) - Privacy Policy