We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
We present a time–parallel technique for the fast generation of self–similar traffic which is suitable for performance studies of Asynchronous Transfer Mode (ATM) networks. Th...
Ioanis Nikolaidis, C. Anthony Cooper, Kalyan S. Pe...
It is widely accepted that complexity of biological systems arises from combinations of common subunits. In this work we investigate the combinatorial patterns of protein domains ...
This paper presents a new statistical image segmentation algorithm, in which the texture features are modeled by Symmetric Alpha-Stable (SαS) distributions. These features are ef...
Abstract. Peer-to-peer (P2P) networks integrate autonomous computing resources without requiring a central coordinating authority, which makes them a potentially robust and scalabl...