Yung-Hsiang Lu - Böcker

Energy efficiency is critical for running computer vision on battery-powered systems, such as mobile phones or UAVs (unmanned aerial vehicles, or drones). This book collects the methods that have won the annual IEEE Low-Power Computer Vision Challenges since 2015. The winners share their solutions and provide insight on how to improve the efficiency of machine learning systems.

Energy efficiency is critical for running computer vision on battery-powered systems, such as mobile phones or UAVs (unmanned aerial vehicles, or drones). This book collects the methods that have won the annual IEEE Low-Power Computer Vision Challenges since 2015. The winners share their solutions and provide insight on how to improve the efficiency of machine learning systems.

Revised for a new second edition, Intermediate C Programming provides a stepping-stone for intermediate-level students to go from writing short programs to writing real programs well. It shows students how to identify and eliminate bugs, write clean code, share code with others, and use standard Linux-based tools, such as ddd and valgrind.This second edition provides expanded coverage of these topics with new material focused on software engineering, including version control and unit testing. The text enhances their programming skills by explaining programming concepts and comparing common mistakes with correct programs. It also discusses how to use debuggers and the strategies for debugging as well as studies the connection between programming and discrete mathematics.Including additional student and instructor resources available online, this book is particularly appealing as a classroom resource.

Revised for a new second edition, Intermediate C Programming provides a stepping-stone for intermediate-level students to go from writing short programs to writing real programs well. It shows students how to identify and eliminate bugs, write clean code, share code with others, and use standard Linux-based tools, such as ddd and valgrind.This second edition provides expanded coverage of these topics with new material focused on software engineering, including version control and unit testing. The text enhances their programming skills by explaining programming concepts and comparing common mistakes with correct programs. It also discusses how to use debuggers and the strategies for debugging as well as studies the connection between programming and discrete mathematics.Including additional student and instructor resources available online, this book is particularly appealing as a classroom resource.

Recursion: Mathematics and Python is designed to help readers develop a clear and systematic understanding of recursion as both a mathematical concept and a programming technique. Rather than presenting recursion as a collection of isolated examples, the book emphasizes recursive thinking: how complex problems can be expressed, analyzed, and solved by breaking them into simpler instances of similar structures.The book adopts a consistent pedagogical approach throughout. Each topic begins with a mathematical or conceptual formulation that highlights the recursive structure of the problem. Readers are guided to identify parameters, base cases, and recursive relationships before translating these ideas into Python programs. Examples are chosen to identify recurring patterns across domains, including integer partitions, Tower of Hanoi, parentheses counting, binary search, quick sort, Sudoku solving, maze traversal, tree structures, and data compression. Code examples are written for clarity. Readers can follow execution flow and understand how recursive calls interact with computer memory. This book also explains how to reduce the recursion time by identifying and removing redundant computation.This book is intended for undergraduate students in computer science and computer engineering who already have basic Python programming experience and some prior exposure to recursion. It is well suited for courses in programming, discrete mathematics, data structures, or algorithms. This book can also help instructors seek a resource that tightly integrates mathematical reasoning with executable code.