Sciweavers

761 search results - page 52 / 153
» Efficient Approximation Algorithms for the Subset-Sums Equal...
Sort
View
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
13 years 9 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
ACL
2004
13 years 9 months ago
Computing Locally Coherent Discourses
We present the first algorithm that computes optimal orderings of sentences into a locally coherent discourse. The algorithm runs very efficiently on a variety of coherence measur...
Ernst Althaus, Nikiforos Karamanis, Alexander Koll...
ASPDAC
2008
ACM
154views Hardware» more  ASPDAC 2008»
13 years 10 months ago
Automated techniques for energy efficient scheduling on homogeneous and heterogeneous chip multi-processor architectures
Abstract-- We address performance maximization of independent task sets under energy constraint on chip multi-processor (CMP) architectures that support multiple voltage/frequency ...
Sushu Zhang, Karam S. Chatha
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 8 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
13 years 9 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...