Sciweavers

118 search results - page 10 / 24
» Fast distributed graph partition and application
Sort
View
117
Voted
HPCC
2009
Springer
14 years 9 months ago
Graph-Based Task Replication for Workflow Applications
Abstract--The Grid is an heterogeneous and dynamic environment which enables distributed computation. This makes it a technology prone to failures. Some related work uses replicati...
Raúl Sirvent, Rosa M. Badia, Jesús L...
122
Voted
PAMI
2007
202views more  PAMI 2007»
14 years 11 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ICDCS
2005
IEEE
15 years 5 months ago
Resource-Aware Distributed Stream Management Using Dynamic Overlays
We consider distributed applications that continuously stream data across the network, where data needs to be aggregated and processed to produce a 'useful' stream of up...
Vibhore Kumar, Brian F. Cooper, Zhongtang Cai, Gre...
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 4 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
DAC
2005
ACM
16 years 18 days ago
Physically-aware HW-SW partitioning for reconfigurable architectures with partial dynamic reconfiguration
Many reconfigurable architectures offer partial dynamic configurability, but current system-level tools cannot guarantee feasible implementations when exploiting this feature. We ...
Sudarshan Banerjee, Elaheh Bozorgzadeh, Nikil D. D...