Learn IT - Books tags combinatorics

Information Retrieval for Music and Motion

Springer, 2007

A general scenario that has attracted a lot of attention for multimedia information retrieval is based on the query-by-example paradigm: retrieve all documents from a database containing parts or aspects similar to a given data fragment. However, multimedia objects, even though they are similar from a structural or semantic viewpoint, often reveal...

Topics in Mathematical Analysis (Series on Analysis, Applications and Computation)

World Scientific Publishing, 2008

This volume consists of a series of lecture notes on mathematical analysis. The contributors have been selected on the basis of both their outstanding scientific level and their clarity of exposition. Thus, the present collection is particularly suited to young researchers and graduate students. Through this volume, the editors intend to provide...

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1

Addison Wesley, 2011

The TITLE of Volume 4 is Combinatorial Algorithms, and when I proposed it I was strongly inclined to add a subtitle: The Kind of Programming I Like Best. Mv editors have decided to tone down such exuberance, but the fact remains that programs with a combinatorial flavor have always been my favorites.

On the other hand I've...

Memory as a Programming Concept in C and C++

Cambridge University Press, 2003

The overwhelming majority of program bugs and computer crashes stem from problems of memory access, allocation, or deallocation. Such memory-related problems are also notoriously difficult to debug. Yet the role that memory plays in C and C++ programming is a subject often overlooked in courses and books because it requires specialized knowledge...

Handbook of Finite Fields (Discrete Mathematics and Its Applications)

CRC Press, 2013

Poised to become the leading reference in the field, the Handbook of Finite Fields is exclusively devoted to the theory and applications of finite fields. More than 80 international contributors compile state-of-the-art research in this definitive handbook. Edited by two renowned researchers, the book uses a uniform style and...

Geometric Algorithms and Combinatorial Optimization (Algorithms and Combinatorics 2)

Springer, 1988

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...

Recent Advances in Formal Languages and Applications (Studies in Computational Intelligence)

Springer, 2006

The theory of formal languages is widely accepted as the backbone of theoretical computer science. It mainly originated from mathematics (combinatorics, algebra, mathematical logic) and generative linguistics. All human problem solving capabilities can be considered in a certain sense as a manipulation of symbols and structures composed by symbols,...

Algorithmic Probability and Combinatorics: Ams Special Sessions on Algorithmic Probability and Combinatorics, October 5-6, 2007, Depaul University, ... Bc, Canada (Contemporary Mathematics)

American Mathematical Society, 2010

This volume contains the proceedings of the AMS Special Sessions on Algorithmic Probability and Combinatories held at DePaul University on October 5-6, 2007 and at the University of British Columbia on October 4-5, 2008.

This volume collects cutting-edge research and expository on algorithmic probability and combinatories. It...

Learning Spaces: Interdisciplinary Applied Mathematics

Springer, 2010

Learning spaces offer a rigorous mathematical foundation for practical systems of educational technology. Learning spaces generalize partially ordered sets and are special cases of knowledge spaces. The various structures are investigated from the standpoints of combinatorial properties and stochastic processes.

Leaning spaces have...

Algorithms in Combinatorial Design Theory (Mathematics Studies)

Elsevier Limited, 1985

Recent years have seen an explosive growth in research in combinatorics and graph theory. One primary factor in this rapid development has been the advent of computers, and the parallel study of practical and efficient algorithms. This volume represents an attempt to...

Recent Trends in Algebraic Combinatorics (Association for Women in Mathematics Series)

Springer, 2019

This edited volume features a curated selection of research in algebraic combinatorics that explores the boundaries of current knowledge in the field. Focusing on topics experiencing broad interest and rapid growth, invited contributors offer survey articles on representation theory, symmetric functions, invariant theory, and...

A Second Course in Formal Languages and Automata Theory

Cambridge University Press, 2008

Intended for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and...

Result Page: 7 6 5 4 3 2 1