372 search results - page 1 / 75 » On Finding Small 2-Generating Sets |
COCOON
2009
Springer
15 years 5 months ago
2009
Springer
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) s.t. every element...
AI
2011
Springer
14 years 2 months ago
2011
Springer
Although propositional satisfiability (SAT) is NP-complete, state-of-the-art SAT solvers are able to solve large, practical instances. The concept of backdoors has been introduced...
JCSS
2008
14 years 10 months ago
2008
There has been much work on the following question: given n, how large can a subset of {1, . . . , n} be that has no arithmetic progressions of length 3. We call such sets 3-free....
MICCAI
2010
Springer
14 years 9 months ago
2010
Springer
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
ICMLA
2008
15 years 5 days ago
2008
We revisit 26 meta-features typically used in the context of meta-learning for model selection. Using visual analysis and computational complexity considerations, we find 4 meta-f...