Sciweavers

1600 search results - page 154 / 320
» Clustering for opportunistic communication
Sort
View
IPCCC
2006
IEEE
16 years 12 days ago
SHARP: a new real-time scheduling algorithm to improve security of parallel applications on heterogeneous clusters
This paper addresses the problem of improving quality of security for real-time parallel applications on heterogeneous clusters. We propose a new security- and heterogeneity-drive...
Tao Xie 0004, Xiao Qin, Mais Nijim
IEEEPACT
1999
IEEE
15 years 10 months ago
A Cost-Effective Clustered Architecture
In current superscalar processors, all floating-point resources are idle during the execution of integer programs. As previous works show, this problem can be alleviated if the fl...
Ramon Canal, Joan-Manuel Parcerisa, Antonio Gonz&a...
NIPS
2008
15 years 7 months ago
Spectral Clustering with Perturbed Data
Spectral clustering is useful for a wide-ranging set of applications in areas such as biological data analysis, image processing and data mining. However, the computational and/or...
Ling Huang, Donghui Yan, Michael I. Jordan, Nina T...
JGAA
2007
124views more  JGAA 2007»
15 years 6 months ago
Energy Models for Graph Clustering
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
Andreas Noack
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 6 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...