— To achieve high performance and resilience to failures, a client can make connections with multiple servers simultaneously and receive different portions of the data from each ...
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
In this paper we describe an automatic procedure for successively reducing the set of possible nonzeros in a Jacobian matrix until eventually the exact sparsity pattern is obtained...
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...