Sciweavers

627 search results - page 12 / 126
» Privacy-Preserving k-NN for Small and Large Data Sets
Sort
View
DATAMINE
2006
127views more  DATAMINE 2006»
14 years 11 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen
BMCBI
2008
133views more  BMCBI 2008»
14 years 11 months ago
A Web-based and Grid-enabled dChip version for the analysis of large sets of gene expression data
Background: Microarray techniques are one of the main methods used to investigate thousands of gene expression profiles for enlightening complex biological processes responsible f...
Luca Corradi, Marco Fato, Ivan Porro, Silvia Scagl...
ICDE
2007
IEEE
162views Database» more  ICDE 2007»
16 years 15 days ago
On Density Based Transforms for Uncertain Data Mining
In spite of the great progress in the data mining field in recent years, the problem of missing and uncertain data has remained a great challenge for data mining algorithms. Many ...
Charu C. Aggarwal
ACSC
2003
IEEE
15 years 2 months ago
Efficient Trie-Based Sorting of Large Sets of Strings
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
Ranjan Sinha, Justin Zobel
ISCA
1993
IEEE
112views Hardware» more  ISCA 1993»
15 years 3 months ago
Working Sets, Cache Sizes, and Node Granularity Issues for Large-Scale Multiprocessors
The distribution of resources among processors, memory and caches is a crucial question faced by designers of large-scale parallel machines. If a machine is to solve problems with...
Edward Rothberg, Jaswinder Pal Singh, Anoop Gupta