1728 search results - page 221 / 346 » The Size of Power Automata |
149
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
193
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
133
click to vote
DM
2002
15 years 6 months ago
2002
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...
196
click to vote
JMIV
2002
15 years 6 months ago
2002
This paper develops a multiscale connectivity theory for shapes based on the axiomatic definition of new generalized connectivity measures, which are obtained using morphology-base...
186
click to vote
MCS
2002
Springer
15 years 6 months ago
2002
Springer
Bagging and boosting are two popular ensemble methods that achieve better accuracy than a single classifier. These techniques have limitations on massive datasets, as the size of t...