643 search results - page 43 / 129 » Merge-Based Computation of Minimal Generators |
ISSTA
2006
ACM
14 years 2 months ago
2006
ACM
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
AAAI
2010
13 years 7 months ago
2010
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
MOBIHOC
2010
ACM
13 years 6 months ago
2010
ACM
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
ACCV
2010
Springer
13 years 4 months ago
2010
Springer
The state of the art for large database object retrieval in images is based on quantizing descriptors of interest points into visual words. High similarity between matching image r...
SDM
2011
SIAM
12 years 11 months ago
2011
SIAM
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...