Sciweavers

177 search results - page 21 / 36
» Distributed Discovery of Large Near-Cliques
Sort
View
PPOPP
2010
ACM
14 years 4 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
IPPS
2007
IEEE
14 years 1 months ago
Distributed Aggregation Algorithms with Load-Balancing for Scalable Grid Resource Monitoring
1 Scalable resource monitoring and discovery are essential to the planet-scale infrastructures such as Grids and PlanetLab. This paper proposes a scalable Grid monitoring architect...
Min Cai, Kai Hwang
IPPS
2008
IEEE
14 years 1 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
KDD
1998
ACM
145views Data Mining» more  KDD 1998»
13 years 11 months ago
Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
Evan W. Steeg, Derek A. Robinson, Ed Willis
CPHYSICS
2007
81views more  CPHYSICS 2007»
13 years 7 months ago
The ATLAS computing model: status, plans and future possibilities
The ATLAS Collaboration[1] has been preparing for Large Hadron Collider (LHC) running for more than 20 years. By summer of 2007 we expect the first colliding beams of protons and...
Shawn McKee