We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Image classification is a critical task for both humans and computers. One of the challenges lies in the large scale of the semantic space. In particular, humans can recognize tens...
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano
—In this paper we describe QsNetIII , an adaptively routed network for High Performance Computing (HPC) applications. We detail the structure of the network, the evolution of our...