32 search results - page 4 / 7 » sac 2011 |
SAC
2011
ACM
12 years 7 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
SAC
2011
ACM
12 years 7 months ago
2011
ACM
Slice sampling provides an easily implemented method for constructing a Markov chain Monte Carlo (MCMC) algorithm. However, slice sampling has two major drawbacks: (i) it requires...
SAC
2011
ACM
12 years 7 months ago
2011
ACM
Wikipedia’s article discussion spaces (“Talk pages”) form a large and growing proportion of the encyclopedia, used for collaboration and article improvement. So far there is...
SAC
2011
ACM
12 years 7 months ago
2011
ACM
Information resources on the Web like videos, images, and documents are increasingly becoming more “social” through user engagement via commenting systems. These commenting sy...
SAC
2011
ACM
12 years 7 months ago
2011
ACM
Mining sequential rules from large databases is an important topic in data mining fields with wide applications. Most of the relevant studies focused on finding sequential rules a...