The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Many intermediate program representations are used by compilers and other software development tools. In this paper, we propose a novel representation technique that, unlike those ...
Fernando Berzal Galiano, Juan Carlos Cubero Talave...
This paper addresses the problem of extracting information from textual documents, either normal documents or web pages. A new approach for extracting complicate information from ...
Luo Xiao, Dieter Wissmann, Michael Brown, Stefan J...
Abstract. We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, th...
Wenqin Zhou, Jacques Carette, David J. Jeffrey, Mi...
In distributed data mining models, adopting a flat node distribution model can affect scalability. To address the problem of modularity, flexibility and scalability, we propose...