3497 search results - page 609 / 700 » Making Distributed Applications Robust |
133
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
151
click to vote
KDD
2005
ACM
16 years 2 months ago
2005
ACM
Web users display their preferences implicitly by navigating through a sequence of pages or by providing numeric ratings to some items. Web usage mining techniques are used to ext...
158
Voted
HPCA
2005
IEEE
16 years 2 months ago
2005
IEEE
Hardware transactional memory should support unbounded transactions: transactions of arbitrary size and duration. We describe a hardware implementation of unbounded transactional ...
114
click to vote
RECOMB
2004
Springer
16 years 2 months ago
2004
Springer
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...
209
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
Service providers like Google and Amazon are moving into the SaaS (Software as a Service) business. They turn their huge infrastructure into a cloud-computing environment and aggr...