Home | Amazing | Today | Tags | Publishers | Years | Account | Search 
Think Complexity: Complexity Science and Computational Modeling
Think Complexity: Complexity Science and Computational Modeling
This book is inspired by boredom and fascination: boredom with the usual presentation of data structures and algorithms, and fascination with complex systems. The problem with data structures is that they are often taught without a motivating context; the problem with complexity science is that it is usually not taught at...
Finite-State Language Processing (Language, Speech, and Communication)
Finite-State Language Processing (Language, Speech, and Communication)

Finite-state devices, which include finite-state automata, graphs, and finite-state transducers, are in wide use in many areas of computer science. Recently, there has been a resurgence of the use of finite-state devices in all aspects of computational linguistics, including dictionary encoding, text processing, and speech processing. This...

Principles of Model Checking
Principles of Model Checking
Our growing dependence on increasingly complex computer and software systems necessitates the development of formalisms, techniques, and tools for assessing functional properties of these systems. One such technique that has emerged in the last twenty years is model checking, which systematically (and automatically) checks whether a model of a...
Mathematical Models of Spoken Language
Mathematical Models of Spoken Language
Humans use language to convey meaningful messages to each other. Linguistic competence consists in the ability to express meaning reliably, not simply to obtain faithful lexical transcriptions. This invaluable reference tool is the product of many years' experience and research on language and speech technology. It presents the motivations for,...
Syntactic Pattern Recognition: An Introduction (Applied Mathematics and Computation; No. 14)
Syntactic Pattern Recognition: An Introduction (Applied Mathematics and Computation; No. 14)
This book was written to provide students, engineers, and scientists involved in pattern recognition, digital image processing, and artificial intelligence with a comprehensive introduction to the concepts and tech- niques of syntactic pattern recognition.

Syntactic pattern recognition is concerned with the
...
Handbook of Weighted Automata (Monographs in Theoretical Computer Science. An EATCS Series)
Handbook of Weighted Automata (Monographs in Theoretical Computer Science. An EATCS Series)

Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, for example, the cost involved when executing a transition, the resources or time needed for this, or the probability or reliability of its successful execution. Weights can also be added to classical automata...

Algebraic Foundations in Computer Science: Essays Dedicated to Symeon Bozapalidis on the Occasion of His Retirement (Lecture Notes in Computer Science)
Algebraic Foundations in Computer Science: Essays Dedicated to Symeon Bozapalidis on the Occasion of His Retirement (Lecture Notes in Computer Science)
This collection of 15 papers honors the career of Symeon Bozapalidis. The focus is on his teaching subjects: algebra, linear algebra, mathematical logic, number theory, automata theory, tree languages and series, algebraic semantics, and fuzzy languages....
Knowledge-Based Neurocomputing
Knowledge-Based Neurocomputing
Neurocomputing methods are loosely based on a model of the brain as a network of simple interconnected processing elements corresponding to neurons. These methods derive their power from the collective processing of artificial neurons, the chief advantage being that such systems can learn and adapt to a changing environment. In knowledge-based...
Natural Computing: 4th International Workshop on Natural Computing
Natural Computing: 4th International Workshop on Natural Computing

The complex behavior of systems in nature is rooted in intricate mechanisms of interaction that often supersede human-made systems in terms of reliability, power efficiency, and computational capacity. Researchers have begun to realize that natural systems are a great source of inspiration for novel algorithms in computation and communication...

Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
In the world we live in concurrency is the norm. For example, the human body
is a massively concurrent system, comprising a huge number of cells, all simultaneously
evolving and independently engaging in their individual biological
processing. In addition, in the biological world, truly sequential systems rarely
arise. However,
...
Foundations of Computing
Foundations of Computing

It may sound surprising that in computing, a field which develops so fast that the future often becomes the past without having been the present, there is nothing more stable and worthwhile learning than its foundations.

It may sound less surprising that in a field with such a revolutionary methodological impact on all sciences and...

Automated Reasoning: 4th International Joint Conference, IJCAR 2008, Sydney, NSW, Australia, August 12-15, 2008, Proceedings
Automated Reasoning: 4th International Joint Conference, IJCAR 2008, Sydney, NSW, Australia, August 12-15, 2008, Proceedings
This book constitutes the refereed proceedings of the 4th International Joint Conference on Automated Reasoning, IJCAR 2008, held in Sydney, Australia, in August 2008. The 26 revised full research papers and 13 revised system descriptions presented together with 4 invited papers and a summary of the CASC-J4 systems competition were carefully...
Result Page: 10 9 8 7 6 5 4 3 2 1 
©2019 LearnIT (support@pdfchm.net) - Privacy Policy