9849 search results - page 21 / 1970 » Algorithms and Experiments for the Webgraph |
129
click to vote
EUROPAR
2001
Springer
15 years 6 months ago
2001
Springer
We present a new result concerning the parallelisation of DBSCAN, a Data Mining algorithm for density-based spatial clustering. The overall structure of DBSCAN has been mapped to a...
103
click to vote
ICDCS
1996
IEEE
15 years 5 months ago
1996
IEEE
This paper reports the design, implementation, and performance of a scalable and efficient tool to replicate Internet information services. Our tool targets replication degrees of...
105
click to vote
JDCTA
2010
14 years 8 months ago
2010
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...
160
click to vote
DAM
2011
14 years 8 months ago
2011
This paper considers a single-vehicle Dial-a-Ride problem in which customers may experience stochastic delays at their pickup locations. If a customer is absent when the vehicle s...
140
click to vote
SAC
2011
ACM
14 years 4 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...