630 search results - page 70 / 126 » Optimized union of non-disjoint distributed data sets |
185
click to vote
CCGRID
2001
IEEE
15 years 9 months ago
2001
IEEE
High performance computing on parallel architectures currently uses different approaches depending on the hardory model of the architecture, the abstraction level of the programmi...
195
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
164
click to vote
CCGRID
2008
IEEE
16 years 18 days ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
156
click to vote
ICASSP
2007
IEEE
16 years 14 days ago
2007
IEEE
Recently graph-cut optimization has been extensively explored for interactive image segmentation. In this paper we propose Discriminative Gaussian Mixtures (DGMs) to boost the per...
161
click to vote
DAGM
1998
Springer
15 years 10 months ago
1998
Springer
This paper introduces a novel statistical mixture model for probabilistic clustering of histogram data and, more generally, for the analysis of discrete co occurrence data. Adoptin...