The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
This paper presents an algorithm for tree-based representation of single images and its applications to segmentation and filtering with depth. In a our recent work, we have addres...
In this paper we present a complete reference framework for the provision of quality assured Trusted Third Party (TTP) services within a medical environment. The main objective is...
Dimitrios Lekkas, Stefanos Gritzalis, Sokratis K. ...
A generic architecture for autonomous agents is presented. In commonwith other current proposals the agent is capable of reacting to and reasoning about events which occur in its ...
Subrata Kumar Das, John Fox, D. Elsdon, Peter Hamm...
rs use models or abstractions that hide low-level implementation details. Various kinds of representations such as data models, state-transition models, and dataflow models can hel...