Sciweavers

162 search results - page 23 / 33
» Parallel frequent set counting
Sort
View
SDM
2012
SIAM
216views Data Mining» more  SDM 2012»
11 years 10 months ago
Feature Selection "Tomography" - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable
:  Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
George Forman
ISCA
2011
IEEE
486views Hardware» more  ISCA 2011»
12 years 11 months ago
Dark silicon and the end of multicore scaling
Since 2005, processor designers have increased core counts to exploit Moore’s Law scaling, rather than focusing on single-core performance. The failure of Dennard scaling, to wh...
Hadi Esmaeilzadeh, Emily R. Blem, Renée St....
MCU
1998
119views Hardware» more  MCU 1998»
13 years 9 months ago
DNA Computing Based on Splicing: Universality Results
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
Gheorghe Paun
IPPS
2007
IEEE
14 years 1 months ago
Enhancing Portability of HPC Applications across High-end Computing Platforms
Fast hardware turnover in supercomputing centers, stimulated by rapid technological progress, results in high heterogeneity among HPC platforms, and necessitates that applications...
Magdalena Slawiñska, Jaroslaw Slawinski, Da...
CCGRID
2005
IEEE
14 years 1 months ago
Servicing range queries on multidimensional datasets with partial replicas
Partial replication is one type of optimization to speed up execution of queries submitted to large datasets. In partial replication, a portion of the dataset is extracted, re-org...
Li Weng, Ümit V. Çatalyürek, Tahs...