22 search results - page 4 / 5 » Random Generation of Finitely Generated Subgroups of a Free ... |
IWANN
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In Machine Learning, ensembles are combination of classifiers. Their objective is to improve the accuracy. In previous works, we have presented a method for the generati...
IJAC
2008
13 years 4 months ago
2008
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
CORR
2008
Springer
2008
Springer
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
13 years 4 months ago
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
DAGM
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Approximations based on random Fourier features have recently emerged as an efficient and elegant methodology for designing large-scale kernel machines [4]. By expressing...