109 search results - page 3 / 22 » SRDA: An Efficient Algorithm for Large-Scale Discriminant An... |
WAN
1998
Springer
13 years 9 months ago
1998
Springer
We present a model for the parallel performance of algorithms that consist of concurrent, two-dimensional wavefronts implemented in a message passing environment. The model combine...
PADL
2009
Springer
14 years 6 months ago
2009
Springer
Analysis of biological data often involves large data sets and computationally expensive algorithms. Databases of biological data continue to grow, leading to an increasing demand ...
FAW
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
EDCC
2008
Springer
13 years 7 months ago
2008
Springer
We present the design, correctness, and analysis of SONDe, a simple fully decentralized object deployment algorithm for highly requested systems. Given an object (service or data)...
IPPS
2010
IEEE
13 years 3 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...