Sciweavers

12194 search results - page 2341 / 2439
» Numberings Optimal for Learning
Sort
View
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
16 years 4 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
16 years 4 months ago
Transforming data to satisfy privacy constraints
Data on individuals and entities are being collected widely. These data can contain information that explicitly identifies the individual (e.g., social security number). Data can ...
Vijay S. Iyengar
HPCA
2008
IEEE
16 years 4 months ago
Supporting highly-decoupled thread-level redundancy for parallel programs
The continued scaling of device dimensions and the operating voltage reduces the critical charge and thus natural noise tolerance level of transistors. As a result, circuits can p...
M. Wasiur Rashid, Michael C. Huang
HPCA
2003
IEEE
16 years 4 months ago
Slipstream Execution Mode for CMP-Based Multiprocessors
Scalability of applications on distributed sharedmemory (DSM) multiprocessors is limited by communication overheads. At some point, using more processors to increase parallelism y...
Khaled Z. Ibrahim, Gregory T. Byrd, Eric Rotenberg
RECOMB
2005
Springer
16 years 4 months ago
Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
Sing-Hoi Sze, Xiaoyan Zhao
« Prev « First page 2341 / 2439 Last » Next »