Sciweavers

385 search results - page 14 / 77
» Scaling up workflow-based applications
Sort
View
HPCC
2005
Springer
14 years 1 months ago
A Coarse Grained Parallel Algorithm for Closest Larger Ancestors in Trees with Applications to Single Link Clustering
Hierarchical clustering methods are important in many data mining and pattern recognition tasks. In this paper we present an efficient coarse grained parallel algorithm for Single...
Albert Chan, Chunmei Gao, Andrew Rau-Chaplin
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 1 months ago
SDR: a better trigger for adaptive variance scaling in normal EDAs
Recently, advances have been made in continuous, normal– distribution–based Estimation–of–Distribution Algorithms (EDAs) by scaling the variance up from the maximum–like...
Peter A. N. Bosman, Jörn Grahl, Franz Rothlau...
IPPS
2008
IEEE
14 years 1 months ago
Overcoming scaling challenges in biomolecular simulations across multiple platforms
NAMD† is a portable parallel application for biomolecular simulations. NAMD pioneered the use of hybrid spatial and force decomposition, a technique now used by most scalable pr...
Abhinav Bhatele, Sameer Kumar, Chao Mei, James C. ...
HOTOS
2003
IEEE
14 years 23 days ago
Palimpsest: Soft-Capacity Storage for Planetary-Scale Services
Distributed writable storage systems typically provide NFS-like semantics and unbounded persistence for files. We claim that for planetary-scale distributed services such facilit...
Timothy Roscoe, Steven Hand