Sciweavers

1254 search results - page 187 / 251
» Making Hard Problems Harder
Sort
View
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
14 years 9 months ago
A hit-miss model for duplicate detection in the WHO drug safety database
The WHO Collaborating Centre for International Drug Monitoring in Uppsala, Sweden, maintains and analyses the world's largest database of reports on suspected adverse drug re...
Andrew Bate, G. Niklas Norén, Roland Orre
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 9 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....
CHI
2005
ACM
14 years 9 months ago
Gait phase effects in mobile interaction
One problem evaluating mobile and wearable devices is that they are used in mobile settings, making it hard to collect usability data. We present a study of tap-based selection of...
Andrew Crossan, Roderick Murray-Smith, Stephen A. ...
POPL
2004
ACM
14 years 9 months ago
Global value numbering using random interpretation
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
Sumit Gulwani, George C. Necula
RECOMB
2004
Springer
14 years 9 months ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...