Sciweavers

543 search results - page 15 / 109
» A Randomized Parallel Sorting Algorithm with an Experimental...
Sort
View
IPPS
1997
IEEE
13 years 11 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
ICPP
1998
IEEE
13 years 12 months ago
Improving Parallel-Disk Buffer Management using Randomized Writeback
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
Mahesh Kallahalla, Peter J. Varman
WSDM
2010
ACM
259views Data Mining» more  WSDM 2010»
14 years 5 months ago
Revisiting Globally Sorted Indexes for Efficient Document Retrieval
There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termina...
Fan Zhang, Shuming Shi, Hao Yan, Ji-Rong Wen
EUROPAR
2003
Springer
14 years 24 days ago
A Parallel Algorithm for Incremental Compact Clustering
In this paper we propose a new parallel clustering algorithm based on the incremental construction of the compact sets of a collection of objects. This parallel algorithm is portab...
Reynaldo Gil-García, José Manuel Bad...
IJAMCIGI
2010
94views more  IJAMCIGI 2010»
13 years 2 months ago
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
Jean-Philippe Hamiez, Jin-Kao Hao, Fred W. Glover