Sciweavers

514 search results - page 56 / 103
» Improving cluster availability using workstation validation
Sort
View
SC
2009
ACM
14 years 2 months ago
Scalable computing with parallel tasks
Recent and future parallel clusters and supercomputers use SMPs and multi-core processors as basic nodes, providing a huge amount of parallel resources. These systems often have h...
Jörg Dümmler, Thomas Rauber, Gudula R&uu...
PAKDD
2004
ACM
96views Data Mining» more  PAKDD 2004»
14 years 1 months ago
Spectral Energy Minimization for Semi-supervised Learning
The use of unlabeled data to aid classification is important as labeled data is often available in limited quantity. Instead of utilizing training samples directly into semi-super...
Chun Hung Li, Zhi-Li Wu
IPPS
1996
IEEE
13 years 12 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
EDBT
2009
ACM
106views Database» more  EDBT 2009»
13 years 11 months ago
AlphaSum: size-constrained table summarization using value lattices
Consider a scientist who wants to explore multiple data sets to select the relevant ones for further analysis. Since the visualization real estate may put a stringent constraint o...
K. Selçuk Candan, Huiping Cao, Yan Qi 0002,...
FSE
2011
Springer
218views Cryptology» more  FSE 2011»
12 years 11 months ago
Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function
In this paper, we present new results on the second-round SHA-3 candidate ECHO. We describe a method to construct a collision in the compression function of ECHO-256 reduced to fou...
Jérémy Jean, Pierre-Alain Fouque