Learn IT - Books tags algorithm

Problems on Algorithms

Prentice Hall, 1995

The ability to devise effective and efficient algorithms in new situations is a skill that separates the master programmer from the merely adequate coder. The best way to develop that skill is to solve problems. To be effective problem solvers, master-programmers-in-training must do more than memorize a collection of...

Modem Theory: An Introduction to Telecommunications

Cambridge University Press, 2009

At the heart of any modern communication system is the modem, connecting the data source to the communication channel. This first course in the mathematical theory of modem design introduces the theory of digital modulation and coding that underpins the design of digital telecommunications systems. A detailed treatment of core subjects is...

Distributed Algorithms: An Intuitive Approach (The MIT Press)

MIT Press, 2013

A comprehensive guide to distributed algorithms that emphasizes examples and exercises rather than mathematical argumentation.

This book offers students and researchers a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models. It avoids mathematical...

WALCOM: Algorithms and Computation: Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008, Proceedings (Lecture Notes in Computer Science)

Springer, 2008

This book constitutes the refereed proceedings of the Second International Workshop on Algorithms and Computation, WALCOM 2008, held in Dhaka, Bangladesh, in February 2008.

The 19 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 57 submissions. The papers feature...

Interconnections: Bridges, Routers, Switches, and Internetworking Protocols (2nd Edition)

Addison Wesley, 1999

Radia Perlman's Interconnections is recognized as a leading text on networking theory and practice. It provides authoritative and comprehensive information on general networking concepts, routing algorithms and protocols, addressing, and the mechanics of bridges, routers, switches, and hubs. This Second...

Approximation Algorithms for NP-Hard Problems

Course Technology PTR, 1996

Approximation algorithms have developed in response to the impossibility of solving a great variety of important optimization problems. Too frequently, when attempting to get a solution for a problem, one is confronted with the fact that the problem is NP-haid. This, in the words of Garey and Johnson, means "I can't find an...

Statistical Performance Analysis and Modeling Techniques for Nanometer VLSI Designs

Springer, 2012

As VLSI technology scales into nanometer regime, chip design engineering faces several challenges. One profound change in the chip design business is that engineers cannot realize the design precisely into the silicon chips. Chip performance, manufacture yield, and lifetime thereby cannot be determined accurately at the design...

Writing for Computer Science

Springer, 2004

Writing for Computer Science is an introduction to doing and describing re- search. For the most part the book is a discussion of good writing style and effective research strategies. Some of the material is accepted wisdom, some is controversial, and some is my opinions. Although the book is brief, it is designed to be...

Real-Time Image and Video Processing: From Research to Reality

Morgan Kaufmann, 2006

This book presents an overview of the guidelines and strategies for transitioning an image or video processing algorithm from a research environment into a real-time constrained environment. Such guidelines and strategies are scattered in the literature of various disciplines including image processing, computer engineering, and software...

Learning Python Design Patterns - Second Edition

Packt Publishing, 2016

Key Features

Understand the structural, creational, and behavioral Python design patterns

Get to know the context and application of design patterns to solve real-world problems in software architecture, design, and application development

Get practical exposure through sample...

Guide to Elliptic Curve Cryptography (Springer Professional Computing)

Springer, 2004

The study of elliptic curves by algebraists, algebraic geometers and number theorists
dates back to the middle of the nineteenth century. There now exists an extensive literature
that describes the beautiful and elegant properties of these marvelous objects. In
1984, Hendrik Lenstra described an ingenious algorithm for factoring...

Genetic Systems Programming: Theory and Experiences (Studies in Computational Intelligence)

Springer, 2006

Designing complex programs such as operating systems, compilers, filing systems, data base systems, etc. is an old ever lasting research area. Genetic programming is a relatively new promising and growing research area. Among other uses, it provides efficient tools to deal with hard problems by evolving creative and competitive solutions. Systems...

Result Page: 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4