Sciweavers

2131 search results - page 103 / 427
» Co-Scheduling of Computation and Data on Computer Clusters
Sort
View
FOCS
2006
IEEE
15 years 10 months ago
The Effectiveness of Lloyd-Type Methods for the k-Means Problem
We investigate variants of Lloyd’s heuristic for clustering high dimensional data in an attempt to explain its popular
Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulma...
DMIN
2009
180views Data Mining» more  DMIN 2009»
15 years 1 months ago
APHID: A Practical Architecture for High-Performance, Privacy-Preserving Data Mining
While the emerging field of privacy preserving data mining (PPDM) will enable many new data mining applications, it suffers from several practical difficulties. PPDM algorithms are...
Jimmy Secretan, Anna Koufakou, Michael Georgiopoul...
NAR
2010
148views more  NAR 2010»
14 years 10 months ago
SIMAP - a comprehensive database of pre-calculated protein sequence similarities, domains, annotations and clusters
The prediction of protein function as well as the reconstruction of evolutionary genesis employing sequence comparison at large is still the most powerful tool in sequence analysi...
Thomas Rattei, Patrick Tischler, Stefan Götz,...
VISSYM
2004
15 years 5 months ago
A Botanically Inspired High-Dimensional Visualization with Multivariate Glyphs
It is difficult for the average viewer to assimilate and comprehend huge amounts of high-dimensional data. It is important to present data in a way that allows the user a high lev...
Eleanor Boyle Chlan, Penny Rheingans
CCGRID
2003
IEEE
15 years 9 months ago
Leveraging Non-Uniform Resources for Parallel Query Processing
Clusters are now composed of non-uniform nodes with different CPUs, disks or network cards so that customers can adapt the cluster configuration to the changing technologies and t...
Tobias Mayr, Philippe Bonnet, Johannes Gehrke, Pra...