Sciweavers

118 search results - page 21 / 24
» Fast distributed graph partition and application
Sort
View
ICDM
2008
IEEE
184views Data Mining» more  ICDM 2008»
14 years 2 months ago
Bayesian Co-clustering
In recent years, co-clustering has emerged as a powerful data mining tool that can analyze dyadic data connecting two entities. However, almost all existing co-clustering techniqu...
Hanhuai Shan, Arindam Banerjee
PAAPP
2006
141views more  PAAPP 2006»
13 years 7 months ago
Algorithmic optimizations of a conjugate gradient solver on shared memory architectures
OpenMP is an architecture-independent language for programming in the shared memory model. OpenMP is designed to be simple and in terms of programming abstractions. Unfortunately,...
Henrik Löf, Jarmo Rantakokko
IEEEPACT
2007
IEEE
14 years 1 months ago
A Flexible Heterogeneous Multi-Core Architecture
Multi-core processors naturally exploit thread-level parallelism (TLP). However, extracting instruction-level parallelism (ILP) from individual applications or threads is still a ...
Miquel Pericàs, Adrián Cristal, Fran...
MODELS
2009
Springer
14 years 2 months ago
An Incremental Algorithm for High-Performance Runtime Model Consistency
We present a novel technique for applying two-level runtime models to distributed systems. Our approach uses graph rewriting rules to transform a high-level source model into one o...
Christopher Wolfe, T. C. Nicholas Graham, W. Greg ...
SASO
2008
IEEE
14 years 1 months ago
Wanderer between the Worlds - Self-Organized Network Stability in Attack and Random Failure Scenarios
Many real–world networks show a scale–free degree distribution, a structure that is known to be very stable in case of random failures. Unfortunately, the very same structure ...
Katharina Anna Zweig, Karin Zimmermann