Search academic resources

Algorithms that must deal with complicated global functions of many variables often exploit the manner in which the given functions factor as a product of "local" functions, each of which depends on a subset of the varia...

Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. A common constraint is that the labels should vary smoothly almost everywhere while preserving sharp discontinuities that may ex...

Este trabalho mostra uma forma de pensar concorrente. São utilizados algoritmos de grafos, algoritmo do menor caminho, para mostrar desde a especificação até a implementação de algoritmos concorrentes. Objetiva-se ...

Early applications of Ant Colony Optimization (ACO) have been mainly concerned with solving ordering problems (e.g., the Traveling Salesperson Problem). More recently, promising results were obtained for solving the Mult...

The parallel computing model used in this paper, the Collective Computing Model (CCM), is a variant of the well-known Bulk Synchronous Parallel (BSP) model. The synchronicity imposed by the BSP model restricts the set of...

Preface to the Second Edition. Preface to the First Edition. Acknowledgments for the Second Edition. Acknowledgments for the First Edition. 1. Introduction and Preview. 1.1 Preview of the Book. 2. Entropy, Relative Entro...

Uno de los algoritmos de rendering de volúmenes más difundido y utilizado es el denominado marching cubes, propuesto por Lorensen y Cline en 1987. En el mismo se busca extraer una superficie umbral a partir de una matr...