Sciweavers

1449 search results - page 110 / 290
» Finiteness results for sigmoidal
Sort
View
AML
2008
53views more  AML 2008»
15 years 6 months ago
Pairs, sets and sequences in first-order theories
In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. Firs...
Albert Visser
CORR
2010
Springer
114views Education» more  CORR 2010»
15 years 6 months ago
On the Stability of Empirical Risk Minimization in the Presence of Multiple Risk Minimizers
Abstract--Recently Kutin and Niyogi investigated several notions of algorithmic stability--a property of a learning map conceptually similar to continuity--showing that training-st...
Benjamin I. P. Rubinstein, Aleksandr Simma
DM
2010
120views more  DM 2010»
15 years 6 months ago
Collineations and dualities of partial geometries
In this paper, we first prove some general results on the number of fixed points of collineations of finite partial geometries, and on the number of absolute points of dualities o...
Beukje Temmermans, Joseph A. Thas, Hendrik Van Mal...
DM
2010
114views more  DM 2010»
15 years 6 months ago
Remarks on a generalization of the Davenport constant
A generalization of the Davenport constant is investigated. For a finite abelian group G and a positive integer k, let Dk(G) denote the smallest such that each sequence over G of l...
Michael Freeze, Wolfgang A. Schmid
DAM
2008
69views more  DAM 2008»
15 years 6 months ago
Impact of memory size on graph exploration capability
A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) inf...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc