Availability, Usage, and Deployment Characteristics of theDomain Name System* (2008)
number 0205523).#
Hierarchical Regions Matching in Image Sequences through Association Graph (2008)
Marco Antônio, Garcia De Carvalho, Roberto De, Alencar Lotufo
Abstract ⎯ We present a hierarchical method to match regions in image sequences based in graph theory. First, we build a graph representation for each image, the so-called tree of critical lakes,...
Cesar Augusto, Cardoso Caetano, Liliane Ventura, Roberto De, Alencar Lotufo
Summary: The effective optical method for evaluating donated corneas is to count the number of the living endothelial cells. The evaluation of the whole endothelium is usually done in a Slit Lamp and...
FEEC-Faculdade de Engenharia Elétrica e de Computaç��o (2008)
Francisco De, Assis Zampirolli, Roberto De, Alencar Lotufo
Abstract. This paper consists of the study of a specialized independent language architecture for the morphological algorithms programming, called mmil. The two major characteristics of this language...
heuristic for Vehicle Routing Problems (2008)
Roberto De, Franceschi Matteo, Fischetti Paolo Toth
Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to cover all customers while satisfying, for each route, both a capacity and a...
Abstract On k-set Consensus Problems in Asynchronous Systems (2008)
Roberto De, Prisco Dahlia, Malkhit Michael, K. Reited
In this paper we investigate the k-set consensus problem in asynchronous, message-passing distributed systems. In this problem, each participating process begins the protocol with an input value and...
Availability, Usage, and Deployment Characteristics of theDomain Name System* (2008)
number 0205523).#
Morphological Operators characterized by neighborhood graphs JUNIOR BARRERA1 (2008)
Francisco De, Assis Zampirolli, Roberto De, Alencar Lotufo
Abstract. Mathematical Morphology is a theory that studies the decomposition of lattice operators in terms of some families of elementary lattice operators. When the lattices considered have a...
Revisiting the Paxos algorithm (2008)
Roberto De Prisco, Roberto De, Prisco Butler, Lampson Nancy Lynch
algorithm is an efficient and highly fault-tolerant algorithm, devised by Lamport, for reaching consensus in a distributed system. Although it appears to be practical, seems to be not widely known or...
Volume Contouring of Generic Unstructured Meshes (2007)
Luiz Fernando Martha, Marcelo Tílio, Monteiro De Carvalho, Roberto De, ...
. This paper describes a generic algorithm for iso-line, iso-strip, iso-surface, and iso-volume visualization of unstructured 3D meshes, such as finite element models. The four types of visualization...
Characteristic Inequalities for Binary Trees (2007)
In a binary tree T of N leaves, the left (right) level l i (r i ) of leaf i is the number of left (right) edges in path from the root to that leaf. The level n i of leaf i is n i = l i +r i ....
Characteristic Inequalities for Binary Trees (2007)
In a binary tree T of N leaves, the left (right) level l i (r i ) of leaf i is the number of left (right) edges in path from the root to that leaf. The level n i of leaf i is n i = l i +r i ....
A Dynamic Primary View Group Communication Service* (2007)
Roberto De, Prisco Alan, Fekete Nancy, Lyncht Alex Shvartsman
View-oriented group communication services are widely used for fault-tolerant distributed computing. For applications involving coherent data, it is important to know when a process has a primary...
Deterministic truthful approximation schemes for scheduling related machines (2007)
Vincenzo Auletta, Roberto De, Prisco Paolo, Penna Pino Persiano
We consider the problem of scheduling on parallel related machines owned by selfish agents. We provide a deterministic polynomial-time approximation scheme and suitable payment functions that yield a...
On k-set Consensus Problems in Asynchronous Systems* (2007)
Roberto De, Prisco Dahlia, Malkhi Michael Reiter
In this paper we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value and by the end of the...
Roberto De, Beauclair Seixas, Marcelo Gattass
Abstract. This article describes two approaches for computing the line-of-sight between objects in real terrain data. Our purpose is to find an efficient algorithm for combat elements in warfare...
On Designing Truthful Mechanisms for Online Scheduling (2005)
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano, Roberto De, Prisco Paolo Penna
We study the online version of the scheduling problem involving selfish agents considered by Archer and Tardos [FOCS 2001]: jobs must be scheduled on m parallel related machines, each of them owned...
Deterministic truthful approximation mechanisms for scheduling related machines (2004)
Vincenzo Auletta, Roberto De, Prisco Paolo, Penna Pino Persiano
We consider the problem of scheduling jobs on parallel related machines owned by selfish agents. We provide deterministic polynomial-time (2 + #)-approximation algorithms and suitable payment...
Sihem Amer-yahia, Luis Gravano, Sergey Brin, Taher Haveliwala, Jayavel Shanmugasundaram, Maha Abdallah, ...
The Power of Verification for One-Parameter Agents (2003)
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Roberto De, Prisco Paolo, Pino Persiano
We study combinatorial optimization problems involving one-parameter selfish agents considered by Archer and Tardos [FOCS 2001]. In particular, we show that, if agents can lie in one direction (that...
How to Route and Tax Selfish Unsplittable Traffic (2003)
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Roberto De, Prisco Paolo, Pino Persiano
We study the problem of assigning unsplittable traffic to a set of $m$ links so to minimize the maximum link congestion (i.e., the makespan). We consider the case of *selfish agents* owning pieces of...
Simple real-time flight over arbitrary-sized terrains. Workshop Brasileiro de GeoInformtica (2002)
Eduardo Poyart, Paula Frederick, Roberto De, Beauclair Seixas, Marcelo Gattass
Abstract. Terrain visualization is an area of active research that has yielded many results in the last decade. Despite all the literature generated, there is still need for a simple and effective...
Toolbox of Image Processing for Numerical Python (2001)
Alexandre Gonçalves Silva, Roberto De, Alencar Lotufo, Rubens Campos Machado
Abstract. This work consists of the study, development and implementation of a toolbox of image processing for Python language [1]. This environment will be useful in education, research and...
Volume Contouring of Generic Unstructured Meshes (1998)
Luiz Fernando Martha, Marcelo Tílio, Monteiro De Carvalho, Roberto De, Beauclair Seixas, Puc-rio Pontifícia, ...
This paper describes a generic algorithm for iso-line, iso-strip, iso-surface, and iso-volume visualization of unstructured 3D meshes, such as finite element models. The four types of visualization...
Novel Automatic PCB Inspection Technique based on Connectivity (1997)
Abstract. This paper presents a novel technique for PCB inspection based on the comparison of the Connected Table of a Reference and a Test Image. The method is based on connected component analysis,...
Novel Automatic PCB Inspection Technique based on Connectivity (1997)
Mauro Hiromu Tatibana, Roberto De, Alencar Lotufo
Abstract. This paper presents a novel technique for PCB inspection based on the comparison of the Connected Table of a Reference and a Test Image. The method is based on connected component analysis,...
Novel Automatic PCB Inspection Technique Based on Connectivity (1997)
Mauro Hiromu Tatibana, Roberto De, Alencar Lotufo
This paper presents a novel technique for PCB inspection based on the comparison of the Connected Table of a Reference and a Test Image. The method is based on connected component analysis, which is...
Morphological Operators characterized by neighborhood graphs (1997)
Junior Barrera Francisco, Francisco De, Assis Zampirolli, Roberto De, Alencar Lotufo
Mathematical Morphology is a theory that studies the decomposition of lattice operators in terms of some families of elementary lattice operators. When the lattices considered have a sup-generating...
On the redundancy achieved by Huffman codes (1996)
Roberto De, Roberto De Prisco, Alfredo De Santis
It has been recently proved that the redundancy r of any discrete memoryless source satisfies r 1 \Gamma H(p N ), where p N is the least likely source letter probability. This bound is achieved only...
Minimal Path Length of Trees with Known Fringe (1995)
In this paper we continue the study of the path length of trees with known fringe as initiated by [1] and [2]. We compute the path length of the minimal tree with given number of leaves N and fringe...
Time-Optimal Message-Efficient Work Performance in the Presence of Faults (1994)
Roberto De, Roberto De Prisco, Alain Mayer, Moti Yung
Performing work in parallel by a multitude of processes in a distributed environment is currently a fast growing area of computer applications (due to its cost effectiveness) . Adaptation of such...