Sciweavers

461 search results - page 60 / 93
» Dynamic Load Balancing in Distributed Hash Tables
Sort
View
HPCC
2005
Springer
14 years 1 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
SAINT
2008
IEEE
14 years 2 months ago
Analysis of a Self-Organizing Maintenance Algorithm under Constant Churn
An increasing proportion of distributed hash tables (DHTs) maintain additional routing information regarding each node’s immediately surrounding neighbors in a network overlay. ...
Richard Price, Tien Tuan Anh Dinh, Georgios K. The...
IJNSEC
2008
95views more  IJNSEC 2008»
13 years 7 months ago
SurePath: An Approach to Resilient Anonymous Routing
Current anonymous systems either use a small, fixed core set of mixes or randomly choose a sequence of peer nodes to form anonymous paths/tunnels. The resulting paths are fragile ...
Yingwu Zhu, Yiming Hu
CF
2006
ACM
14 years 1 months ago
Memory efficient parallel matrix multiplication operation for irregular problems
Regular distributions for storing dense matrices on parallel systems are not always used in practice. In many scientific applicati RUMMA) [1] to handle irregularly distributed mat...
Manojkumar Krishnan, Jarek Nieplocha
ICPP
2003
IEEE
14 years 1 months ago
A Parallel Algorithm for Enumerating Combinations
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n − ...
Martha Torres, Alfredo Goldman, Junior Barrera