The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
Costin Raiciu, Felipe Huici, Mark Handley, David S...
This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspondence calcul...
Abstract— Zero-padded OFDM (ZP-OFDM) systems have recently been adopted in certain wireless systems, such as the multiband-OFDM based WiMedia standard, instead of the more common...
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...