Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
Abstract. The maximum diversity problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
L. F. Santos, Marcos Henrique Ribeiro, Alexandre P...
Abstract. This contribution shows how unsupervised Markovian segmentation techniques can be accelerated when implemented on graphics hardware equipped with a Graphics Processing Un...
Abstract. This article presents special quadrilateral quadratic refinement elements, which provide geometry and field continuity across Tjunctions where two elements are connecte...
Abstract. In the Internet era, the development of Web applications has impressively evolved and is characterized by a large degree of complexity. To this end, software community ha...