Sciweavers

162 search results - page 28 / 33
» An Adaptive Parallel Hierarchical Clustering Algorithm
Sort
View
WWW
2011
ACM
14 years 4 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
ICS
2005
Tsinghua U.
15 years 3 months ago
Automatic generation and tuning of MPI collective communication routines
In order for collective communication routines to achieve high performance on different platforms, they must be able to adapt to the system architecture and use different algori...
Ahmad Faraj, Xin Yuan
CLUSTER
2009
IEEE
15 years 4 months ago
Oblivious routing schemes in extended generalized Fat Tree networks
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
Germán Rodríguez, Cyriel Minkenberg,...
ICDCSW
2005
IEEE
15 years 3 months ago
Adaptive Real-Time Anomaly Detection with Improved Index and Ability to Forget
Anomaly detection in IP networks, detection of deviations from what is considered normal, is an important complement to misuse detection based on known attack descriptions. Perfor...
Kalle Burbeck, Simin Nadjm-Tehrani
IJHPCA
2006
99views more  IJHPCA 2006»
14 years 9 months ago
A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms
Today, large scale parallel systems are available at relatively low cost. Many powerful such systems have been installed all over the world and the number of users is always incre...
Lionel Eyraud