56 search results - page 10 / 12 » Improving the performance of I O-intensive applications on c... |
ICPP
1999
IEEE
13 years 10 months ago
1999
IEEE
The probability of failures in software distributed shared memory (SDSM) increases as the system size grows. This paper introduces a new, efficient message logging technique, call...
KDD
2007
ACM
14 years 6 months ago
2007
ACM
Given its importance, the problem of predicting rare classes in large-scale multi-labeled data sets has attracted great attentions in the literature. However, the rare-class probl...
WWW
2008
ACM
14 years 6 months ago
2008
ACM
Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modificatio...
AI
2010
Springer
13 years 5 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
SIGIR
2009
ACM
14 years 8 days ago
2009
ACM
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...