Sciweavers

372 search results - page 1 / 75
» On Finding Small 2-Generating Sets
Sort
View
COCOON
2009
Springer
15 years 4 months ago
On Finding Small 2-Generating Sets
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...
Isabelle Fagnot, Guillaume Fertin, Stéphane...
AI
2011
Springer
14 years 1 months ago
Finding Small Backdoors in SAT Instances
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...
Zijie Li, Peter van Beek
JCSS
2008
87views more  JCSS 2008»
14 years 10 months ago
Finding large 3-free sets I: The small n case
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....
William I. Gasarch, James Glenn, Clyde P. Kruskal
MICCAI
2010
Springer
14 years 8 months ago
Segmentation Subject to Stitching Constraints: Finding Many Small Structures in a Large Image
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
Elena Bernardis, Stella X. Yu
ICMLA
2008
14 years 11 months ago
Predicting Algorithm Accuracy with a Small Set of Effective Meta-Features
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...
Jun Won Lee, Christophe G. Giraud-Carrier