Sciweavers

630 search results - page 106 / 126
» Optimized union of non-disjoint distributed data sets
Sort
View
IEEEPACT
2006
IEEE
15 years 3 months ago
An empirical evaluation of chains of recurrences for array dependence testing
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...
Johnnie Birch, Robert A. van Engelen, Kyle A. Gall...
78
Voted
BMCBI
2010
112views more  BMCBI 2010»
14 years 9 months ago
Orientation-dependent backbone-only residue pair scoring functions for fixed backbone protein design
Background: Empirical scoring functions have proven useful in protein structure modeling. Most such scoring functions depend on protein side chain conformations. However, backbone...
Andrew J. Bordner
PRL
2007
138views more  PRL 2007»
14 years 9 months ago
Ent-Boost: Boosting using entropy measures for robust object detection
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
Duy-Dinh Le, Shin'ichi Satoh
ICS
2011
Tsinghua U.
14 years 1 months ago
Hystor: making the best use of solid state drives in high performance storage systems
With the fast technical improvement, flash memory based Solid State Drives (SSDs) are becoming an important part of the computer storage hierarchy to significantly improve perfo...
Feng Chen, David A. Koufaty, Xiaodong Zhang
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
15 years 10 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye