Sciweavers

6546 search results - page 87 / 1310
» Improving the Performance of the RISE Algorithm
Sort
View
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
13 years 10 months ago
Improved Steiner tree approximation in graphs
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...
Gabriel Robins, Alexander Zelikovsky
SIGCOMM
2009
ACM
14 years 3 months ago
ROAR: increasing the flexibility and performance of distributed search
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...
3DIM
2001
IEEE
14 years 14 days ago
The Parallel Iterative Closest Point Algorithm
This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspondence calcul...
Christian Langis, Michael A. Greenspan, Guy Godin
ICC
2007
IEEE
14 years 3 months ago
Improved Equalization For Coded, Zero-Padded OFDM (ZP-OFDM) Systems
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...
Monisha Ghosh
INFOVIS
2003
IEEE
14 years 2 months ago
Improving Hybrid MDS with Pivot-Based Searching
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...
Alistair Morrison, Matthew Chalmers