The single class best effort service available in the current Internet does not provide the guarantees, typically expressed in terms of minimum bandwidth and/or maximum delay or l...
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
This paper presents a method for selection of SIFT(Scale-Invariant Feature Transform) feature points using OC-SVM (One Class-Support Vector Machines). We proposed the method for au...
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
We concentrate on automated synthesis of multitolerant programs, i.e., programs that tolerate multiple classes of faults and provide a (possibly) different level of fault-toleranc...