Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
Phrase structure trees have a hierarchical structure. In many subjects, most notably in taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierar...
Component Based Development (CBD) aims at constructing software through the integration, using interfaces and contracts, between pre-existing components. The main goal of this wor...
Robson P. de Souza, Marcelo N. Costa, Regina M. M....
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...