Search academic resources

Approximation algorithms for a class of planar graph problems, including planar independent set, planar vertex cover and planar dominating set, were intensively studied. The current upper bound on the running time of the...

It is a well established fact, that - in the case of classical random graphs like (variants of) Gn,p or random regular graphs - spectral methods yield efficient algorithms for clustering (e. g. colouring or bisection) pr...

This paper describes an algorithm to determine whether a point is inside or outside a curvilinear polygon, based on the well known algorithm consisting of counting the intersections of an horizontal ray with the polygon....

Conventional operating systems, like Silicon Graphics' IRIX and IBM's AIX, adopt a single Memory Management algorithm. The choice of this algorithm is usually based on its good performance in relation to the set of progr...

Biologically realistic computer simulation of vertebrate locomotion is an interesting and challenging problem with applications in computer graphics and robotics. One current approach simulates a relatively simple verteb...

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 ...

This paper proposes two parallel variants of an Estimation of Distribution Algorithm (EDA) that represents the probability distribution by means of a single connected graphical model based on a polytree structure. The ma...

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...

Instances of static scheduling problems can be easily represented as graphs where each node represents a particular operation. This property makes the Ant Colony Algorithms well suited for different kinds of scheduling p...

Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node knows the positions of all neighbors in its transmission r...

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...

The purpose of this paper is to describe how some theorems about constructions in categories can be seen as a way of doing generic programming. No prior knowledge of category theory is required to understand the paper. ...

An important challenge when studying the semantics2 of programming languages is understanding the way syntactical constructions in high-level programming languages produce algorithms that are bound to the underlying virt...

Este artigo descreve o projeto Usando Robôs para Ensino de Algoritmos, que tem como objetivo minimizar as dificuldades encontradas pelos alunos das matérias de Algoritmos e Programação nos primeiros períodos do curs...

Let G = (V;E) be a digraph with a distinguished set of terminal vertices K V and a vertex s 2 K . We de ne the s;K-diameter of G as the maximum distance between s and any of vertices of K. If the arcs fail randomly and...

The Relationship Networks Project (RR - Redes de Relacionamento) is an innovative project, which intends to create a framework, which allows - through a fast data modeling - implementing interface elements that describe ...

El objetivo central del proyecto es diseñar algoritmos eficientes para problemas de grafos, previo estudio de su tratabilidad. Nos centramos, en particular, en los problemas de coloreo y transversal en hipergrafos de in...

El eje central de la línea de investigación lo constituye el estudio de los temas de procesamiento paralelo y distribuido para cómputo de altas prestaciones, en lo referente a los fundamentos y a las aplicaciones. In...

Se presenta la formalización de un método de aproximación de refracciones basado en mapas de entorno [3]. Esta aproximación se puede incorporar facilmente en el proceso de renderití'g con 8J.goritmos scan-Zinc [14/ ...

Se presenta el algoritmo de una técnica de Compresión de Audio en el Espacio Transformado. El trabajo es continuación de una serie de investigaciones y desarrollos que los autores han realizado desde 1995 y aquí se ...

A novel method based on shape and texture information is proposed in this paper for facial expression recognition from video sequences. The Discriminant Non-negative Matrix Factorization (DNMF) algorithm is applied at th...

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 [3]. En el mismo se busca extraer una superficie umbral a partir de una ...

The 3D tree visualization faces multiple challenges: the election of an appropriate layout, the use of the interactions that make the data exploration easier and a metaphor that helps in the process of information unders...

In this work we present several techniques applied to implement an Image Space Software Occlusion Culling Engine to increase the speed of rendering general dynamic scenes with high depth complexity. This conservative cul...