|
|
|
Hacker's Delight (2nd Edition)
In Hacker’s Delight, Second Edition, Hank Warren once again compiles an irresistible collection of programming hacks: timesaving techniques, algorithms, and tricks that help programmers build more elegant and efficient software, while also gaining deeper insights into their craft. Warren’s hacks... | | Fundamental Approach to Discrete Mathematics
The salient features of this book include: strong coverage of key topics involving recurrence relation, combinatorics, Boolean algebra, graph theory and fuzzy set theory. Algorithms and examples integrated throughout the book to bring clarity to the fundamental concepts. Each concept and definition is followed by thoughtful examples. There is... | | Design of Analog Cmos Integrated Cir
In the past two decades, CMOS technology has rapidly embraced the field of analog inte-
grated circuits, providing low-cost, high-performance solutions and rising to dominate the
market. While silicon bipolar and III-V devices still find niche applications, only CMOS
processes have emerged as a viable choice for the integration of... |
|
Filtering, Segmentation and Depth (Lecture Notes in Computer Science)
Computer vision seeks a process that starts with a noisy, ambiguous signal from a TV
camera and ends with a high-level description of discrete objects located in 3-dimensional
space and identified in a human classification. In this book we address this process at
several levels. We first treat the low-level image-processing issues of... | | Data Structures and Algorithm Analysis in Java (3rd Edition)
This new Java edition describes data structures, methods of organizing large amounts of data, and algorithm analysis, the estimation of the running time of algorithms. As computers become faster and faster, the need for programs that can handle large amounts of input becomes more acute. Paradoxically, this requires more... | | Data Structures and Algorithm Analysis in C (2nd Edition)
This book describes data structures, methods of organizing large amounts of data, and algorithm analysis, the estimation of the running time of algorithms. As computers become faster and faster, the need for programs that can handle large amounts of input becomes more acute. Paradoxically, this requires more careful attention... |
|
|
Result Page: 37 36 35 34 33 32 31 30 29 28 27 26 25 |