Skip to main content Accessibility help
×
  1. Home
  2. Browse subjects
  3. Computer Science
  4. Content listing

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

48202 results in Computer Science

Page 1251 of 2411

Digital Signal Processing
  • System Analysis and Design
  • 2nd edition
  • Paulo S. R. Diniz, Eduardo A. B. da Silva, Sergio L. Netto
  • Published online:
    05 June 2012
    Print publication:
    02 September 2010
  • This new, fully-revised edition covers all the major topics of digital signal processing (DSP) design and analysis in a single, all-inclusive volume, interweaving theory with real-world examples and design trade-offs. Building on the success of the original, this edition includes new material on random signal processing, a new chapter on spectral estimation, greatly expanded coverage of filter banks and wavelets, and new material on the solution of difference equations. Additional steps in mathematical derivations make them easier to follow, and an important new feature is the do-it-yourself section at the end of each chapter, where readers get hands-on experience of solving practical signal processing problems in a range of MATLAB experiments. With 120 worked examples, 20 case studies, and almost 400 homework exercises, the book is essential reading for anyone taking DSP courses. Its unique blend of theory and real-world practical examples also makes it an ideal reference for practitioners.

Term Rewriting and All That
  • Franz Baader, Tobias Nipkow
  • Published online:
    05 June 2012
    Print publication:
    05 March 1998
  • This textbook offers a unified and self-contained introduction to the field of term rewriting. It covers all the basic material (abstract reduction systems, termination, confluence, completion, and combination problems), but also some important and closely connected subjects: universal algebra, unification theory, Gröbner bases and Buchberger's algorithm. The main algorithms are presented both informally and as programs in the functional language Standard ML (an appendix contains a quick and easy introduction to ML). Certain crucial algorithms like unification and congruence closure are covered in more depth and Pascal programs are developed. The book contains many examples and over 170 exercises. This text is also an ideal reference book for professional researchers: results that have been spread over many conference and journal articles are collected together in a unified notation, proofs of almost all theorems are provided, and each chapter closes with a guide to the literature.

P, NP, and NP-Completeness
  • The Basics of Computational Complexity
  • Oded Goldreich
  • Published online:
    05 June 2012
    Print publication:
    16 August 2010
  • The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete.

A Guide to MATLAB
  • For Beginners and Experienced Users
  • Brian R. Hunt, Ronald L. Lipsman, Jonathan M. Rosenberg
  • Published online:
    05 June 2012
    Print publication:
    06 August 2001
  • This book is a short, focused introduction to MATLAB, a comprehensive software system for mathematics and technical computing. It should be useful to both beginning and experienced users. It contains concise explanations of essential MATLAB commands, as well as easily understood instructions for using MATLAB's programming features, graphical capabilities, and desktop interface. It also includes an introduction to SIMULINK, a companion to MATLAB for system simulation. Written for MATLAB 6, this book can also be used with earlier (and later) versions of MATLAB. This book contains worked-out examples of applications of MATLAB to interesting problems in mathematics, engineering, economics, and physics. In addition, it contains explicit instructions for using MATLAB's Microsoft Word interface to produce polished, integrated, interactive documents for reports, presentations, or on-line publishing. This book explains everything you need to know to begin using MATLAB to do all these things and more. Intermediate and advanced users will find useful information here, especially if they are making the switch to MATLAB 6 from an earlier version.

A Computational Introduction to Number Theory and Algebra
  • Victor Shoup
  • Published online:
    05 June 2012
    Print publication:
    28 April 2005
  • Number theory and algebra play an increasingly significant role in computing and communications, as evidenced by the striking applications of these subjects to such fields as cryptography and coding theory. This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience. The mathematical prerequisites are minimal: nothing beyond material in a typical undergraduate course in calculus is presumed, other than some experience in doing proofs - everything else is developed from scratch. Thus the book can serve several purposes. It can be used as a reference and for self-study by readers who want to learn the mathematical foundations of modern cryptography. It is also ideal as a textbook for introductory courses in number theory and algebra, especially those geared towards computer science students.

Computational Linguistics and Formal Semantics
  • Edited by Michael Rosner, Roderick Johnson
  • Published online:
    05 June 2012
    Print publication:
    30 October 1992
  • This 1992 collection takes the exciting step of examining natural language phenomena from the perspective of both computational linguistics and formal semantics. Computational linguistics has until now been primarily concerned with the construction of computational models for handling the complexities of linguistic form, but has not tackled the questions of representing or computing meaning. Formal semantics, on the other hand, has attempted to account for the relations between forms and meanings, without necessarily attending to computational concerns. The book introduces the reader to the two disciplines and considers the prospects for the more unified and comprehensive computational theory of language which might obtain from their amalgamation. Of great interest to those working in the fields of computation, logic, semantics, artificial intelligence and linguistics generally.

Computational Complexity
  • A Conceptual Perspective
  • Oded Goldreich
  • Published online:
    05 June 2012
    Print publication:
    28 April 2008
  • Complexity theory is a central field of the theoretical foundations of computer science. It is concerned with the general study of the intrinsic complexity of computational tasks; that is, it addresses the question of what can be achieved within limited time (and/or with other limited natural computational resources). This book offers a conceptual perspective on complexity theory. It is intended to serve as an introduction for advanced undergraduate and graduate students, either as a textbook or for self-study. The book will also be useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems. In each case, the author starts by posing the intuitive questions that are addressed by the sub-area and then discusses the choices made in the actual formulation of these questions, the approaches that lead to the answers, and the ideas that are embedded in these answers.

Mathematical Theory of Domains
  • V. Stoltenberg-Hansen, I. Lindström, E. R. Griffor
  • Published online:
    05 June 2012
    Print publication:
    22 September 1994
  • Domain theory is an established part of theoretical computer science, used in giving semantics to programming languages and logics. In mathematics and logic it has also proved to be useful in the study of algorithms. This book is devoted to providing a unified and self-contained treatment of the subject. The theory is presented in a mathematically precise manner which nevertheless is accessible to mathematicians and computer scientists alike. The authors begin with the basic theory including domain equations, various domain representations and universal domains. They then proceed to more specialized topics such as effective and power domains, models of lambda-calculus and so on. In particular, the connections with ultrametric spaces and the Kleene–Kreisel continuous functionals are made precise. Consequently the text will be useful as an introductory textbook (earlier versions have been class-tested in Uppsala, Gothenburg, Passau, Munich and Swansea), or as a general reference for professionals in computer science and logic.

Lisp in Small Pieces
  • Christian Queinnec
  • Translated by Kathleen Callaway
  • Published online:
    05 June 2012
    Print publication:
    28 June 1996
  • This is a comprehensive account of the semantics and the implementation of the whole Lisp family of languages, namely Lisp, Scheme and related dialects. It describes 11 interpreters and 2 compilers, including very recent techniques of interpretation and compilation. The book is in two parts. The first starts from a simple evaluation function and enriches it with multiple name spaces, continuations and side-effects with commented variants, while at the same time the language used to define these features is reduced to a simple lambda-calculus. Denotational semantics is then naturally introduced. The second part focuses more on implementation techniques and discusses precompilation for fast interpretation: threaded code or bytecode; compilation towards C. Some extensions are also described such as dynamic evaluation, reflection, macros and objects. This will become the new standard reference for people wanting to know more about the Lisp family of languages: how they work, how they are implemented, what their variants are and why such variants exist. The full code is supplied (and also available over the Net). A large bibliography is given as well as a considerable number of exercises. Thus it may also be used by students to accompany second courses on Lisp or Scheme.

Introduction to Information Retrieval
  • Christopher D. Manning, Prabhakar Raghavan, Hinrich Schütze
  • Published online:
    05 June 2012
    Print publication:
    07 July 2008
  • Class-tested and coherent, this textbook teaches classical and web information retrieval, including web search and the related areas of text classification and text clustering from basic concepts. It gives an up-to-date treatment of all aspects of the design and implementation of systems for gathering, indexing, and searching documents; methods for evaluating systems; and an introduction to the use of machine learning methods on text collections. All the important ideas are explained using examples and figures, making it perfect for introductory courses in information retrieval for advanced undergraduates and graduate students in computer science. Based on feedback from extensive classroom experience, the book has been carefully structured in order to make teaching more natural and effective. Slides and additional exercises (with solutions for lecturers) are also available through the book's supporting website to help course instructors prepare their lectures.

Quantum Computer Science
  • An Introduction
  • N. David Mermin
  • Published online:
    05 June 2012
    Print publication:
    30 August 2007
  • In the 1990's it was realized that quantum physics has some spectacular applications in computer science. This book is a concise introduction to quantum computation, developing the basic elements of this new branch of computational theory without assuming any background in physics. It begins with an introduction to the quantum theory from a computer-science perspective. It illustrates the quantum-computational approach with several elementary examples of quantum speed-up, before moving to the major applications: Shor's factoring algorithm, Grover's search algorithm, and quantum error correction. The book is intended primarily for computer scientists who know nothing about quantum theory, but will also be of interest to physicists who want to learn the theory of quantum computation, and philosophers of science interested in quantum foundational issues. It evolved during six years of teaching the subject to undergraduates and graduate students in computer science, mathematics, engineering, and physics, at Cornell University.

UML by Example
  • Ghinwa Jalloul
  • Published online:
    05 June 2012
    Print publication:
    19 January 2004
  • This is a step-by-step introduction to object-oriented software development. It is suitable for teaching and for self study by practising software engineers seeking to add rigour to their techniques. Seven complete case studies are included along with several smaller examples derived from small software projects developed for and delivered to real users. These examples make use of a bridge process, which presents a systematic approach for developing analysis models and unfolding these incrementally and iteratively through to design models and implementation. The process could be viewed as one example of unified software development and has the potential of being scalable to large software problems. It also provides a model for organising deliverables obtained throughout different phases of the software life cycle. These case studies provide a medium for experimental use and act as templates that can be tailored by readers to fit their specific needs and circumstances.

Lambda-Calculus and Combinators
  • An Introduction
  • 2nd edition
  • J. Roger Hindley, Jonathan P. Seldin
  • Published online:
    05 June 2012
    Print publication:
    24 July 2008
  • Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this version is thoroughly revised and offers an account of the subject with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book.

Steps in Scala
  • An Introduction to Object-Functional Programming
  • Christos K. K. Loverdos, Apostolos Syropoulos
  • Published online:
    05 June 2012
    Print publication:
    23 September 2010
  • Scala is a highly expressive, concise and scalable language. It is also the most prominent method of the new and exciting methodology known as object-functional programming. In this book, the authors show how Scala grows to the needs of the programmer, whether professional or hobbyist. They teach Scala with a step-by-step approach and explain how to exploit the full power of the industry-proven JVM technology. Readers can then dive into specially chosen design challenges and implementation problems, inspired by the trials of real-world software engineering. It also helps readers to embrace the power of static typing and automatic type inference. In addition, the book shows how to use the dual-object and functional-oriented natures combined at Scala's core, and so write code that is less 'boilerplate', giving a genuine increase in productivity.

Graphs, Surfaces and Homology
  • 3rd edition
  • Peter Giblin
  • Published online:
    05 June 2012
    Print publication:
    12 August 2010
  • Homology theory is a powerful algebraic tool that is at the centre of current research in topology and its applications. This accessible textbook will appeal to mathematics students interested in the application of algebra to geometrical problems, specifically the study of surfaces (sphere, torus, Mobius band, Klein bottle). In this introduction to simplicial homology - the most easily digested version of homology theory - the author studies interesting geometrical problems, such as the structure of two-dimensional surfaces and the embedding of graphs in surfaces, using the minimum of algebraic machinery and including a version of Lefschetz duality. Assuming very little mathematical knowledge, the book provides a complete account of the algebra needed (abelian groups and presentations), and the development of the material is always carefully explained with proofs given in full detail. Numerous examples and exercises are also included, making this an ideal text for undergraduate courses or for self-study.

Discrete Mathematics
  • An Introduction for Software Engineers
  • Mike Piff
  • Published online:
    05 June 2012
    Print publication:
    27 June 1991
  • Computing developed as a branch of mathematics, only to drift away from this home as computer science diverged towards more general topics such as the theory of how a computer works. Recently the emphasis has become more mathematical and the new disciplines of software engineering and information technology have emerged. This book is designed to form the basis of a one year course in discrete mathematics for first year computer scientists or software engineers. The material presented covers much of undergraduate algebra with a particular bias towards the computing applications. Topics covered include mathematical logic, set theory, finite and infinite relations and mappings, graphs, graphical algorithms and axiom systems. It concludes with implementations of many of the algorithms in Modula-2 to illustrate how the mathematics may be turned into concrete calculations. Numerous examples and exercises are included with selected solutions to the problems appearing in the appendix. Discrete mathematics is the basic language which every student of computing should take pride in mastering and this book should prove an essential tool in this aim.

An Introduction to Many-Valued and Fuzzy Logic
  • Semantics, Algebras, and Derivation Systems
  • Merrie Bergmann
  • Published online:
    05 June 2012
    Print publication:
    14 January 2008
  • Professor Merrie Bergmann presents an accessible introduction to the subject of many-valued and fuzzy logic designed for use on undergraduate and graduate courses in non-classical logic. Bergmann discusses the philosophical issues that give rise to fuzzy logic - problems arising from vague language - and returns to those issues as logical systems are presented. For historical and pedagogical reasons, three-valued logical systems are presented as useful intermediate systems for studying the principles and theory behind fuzzy logic. The major fuzzy logical systems - Lukasiewicz, Gödel, and product logics - are then presented as generalisations of three-valued systems that successfully address the problems of vagueness. A clear presentation of technical concepts, this book includes exercises throughout the text that pose straightforward problems, that ask students to continue proofs begun in the text, and that engage students in the comparison of logical systems.

Iterative Methods in Combinatorial Optimization
  • Lap Chi Lau, R. Ravi, Mohit Singh
  • Published online:
    05 June 2012
    Print publication:
    18 April 2011
  • With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.

Algorithmic Geometry
  • Jean-Daniel Boissonnat, Mariette Yvinec
  • Translated by Herve Bronniman
  • Published online:
    05 June 2012
    Print publication:
    05 March 1998
  • The design and analysis of geometric algorithms have seen remarkable growth in recent years, due to their application in, for example, computer vision, graphics, medical imaging and CAD. The goals of this book are twofold: first to provide a coherent and systematic treatment of the foundations; secondly to present algorithmic solutions that are amenable to rigorous analysis and are efficient in practical situations. When possible, the algorithms are presented in their most general d-dimensional setting. Specific developments are given for the 2- or 3-dimensional cases when this results in significant improvements. The presentation is confined to Euclidean affine geometry, though the authors indicate whenever the treatment can be extended to curves and surfaces. The prerequisites for using the book are few, which will make it ideal for teaching advanced undergraduate or beginning graduate courses in computational geometry.

Classical and Quantum Information Theory
  • An Introduction for the Telecom Scientist
  • Emmanuel Desurvire
  • Published online:
    05 June 2012
    Print publication:
    19 February 2009
  • Information theory lies at the heart of modern technology, underpinning all communications, networking, and data storage systems. This book sets out, for the first time, a complete overview of both classical and quantum information theory. Throughout, the reader is introduced to key results without becoming lost in mathematical details. Opening chapters present the basic concepts and various applications of Shannon's entropy, moving on to the core features of quantum information and quantum computing. Topics such as coding, compression, error-correction, cryptography and channel capacity are covered from classical and quantum viewpoints. Employing an informal yet scientifically accurate approach, Desurvire provides the reader with the knowledge to understand quantum gates and circuits. Highly illustrated, with numerous practical examples and end-of-chapter exercises, this text is ideal for graduate students and researchers in electrical engineering and computer science, and practitioners in the telecommunications industry. Further resources and instructor-only solutions are available at www.cambridge.org/9780521881715.

Page 1251 of 2411