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
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
Data stream management systems (DSMSs) process continuous queries over streaming data in real-time adhering to quality of service requirements. The data streams generated from sen...
SAC
2011
ACM
12 years 7 months ago
2011
ACM
Higher-Order Logic (HOL) is based on a small logic kernel, whose
SAC
2011
ACM
12 years 7 months ago
2011
ACM
A moving region whose location and extend change over time can imply topological changes such as region split and hole formation. To study this phenomenon is useful in many applic...
SAC
2011
ACM
12 years 7 months ago
2011
ACM
It is well known that the main objective of conceptual retrieval models is to go beyond simple term matching by relaxing term independence assumption through concept recognition. ...
SAC
2011
ACM
12 years 7 months ago
2011
ACM
Regression testing is often performed with a time budget and it does not allow executing all test cases. Test case prioritization techniques re-order test cases to increase the ra...
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...
SAC
2011
ACM
12 years 7 months ago
2011
ACM
SAC
2011
ACM
12 years 7 months ago
2011
ACM
In many criminal cases, forensically collected data contain valuable information about a suspect’s social networks. An investigator often has to manually extract information fro...