Sciweavers

12659 search results - page 305 / 2532
» The distributed breakout algorithms
Sort
View
ICDCN
2011
Springer
14 years 10 months ago
Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
Maitreya Natu, Vaishali P. Sadaphal, Sangameshwar ...
CLUSTER
2011
IEEE
14 years 6 months ago
Achieving Scalable Parallelization for the Hessenberg Factorization
—Much of dense linear algebra has been successfully blocked to concentrate the majority of its time in the Level 3 BLAS, which are not only efficient for serial computation, but...
Anthony M. Castaldo, R. Clint Whaley
164
Voted
COLING
2010
15 years 1 months ago
Semi-supervised Semantic Pattern Discovery with Guidance from Unsupervised Pattern Clusters
We present a simple algorithm for clustering semantic patterns based on distributional similarity and use cluster memberships to guide semi-supervised pattern discovery. We apply ...
Ang Sun, Ralph Grishman
181
Voted
TDP
2010
166views more  TDP 2010»
15 years 1 months ago
Communication-Efficient Privacy-Preserving Clustering
The ability to store vast quantities of data and the emergence of high speed networking have led to intense interest in distributed data mining. However, privacy concerns, as well ...
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Reb...
ICASSP
2011
IEEE
14 years 10 months ago
On cooperative image denoising
In this paper we suggest how several competing image denoising algorithms, differing in design parameters, or even in design principles, can be combined together to yield a better...
Maciej Niedzwiecki, Szymon Gackowski