Sciweavers

36781 search results - page 50 / 7357
» Parameterizing by the Number of Numbers
Sort
View
MLQ
2008
57views more  MLQ 2008»
13 years 10 months ago
Groupwise density cannot be much bigger than the unbounded number
We prove that g (the groupwise density number) is smaller or equal to b+, the successor of the minimal cardinality of an unbounded subset of . This is true even for the version of ...
Saharon Shelah
NDJFL
2000
44views more  NDJFL 2000»
13 years 10 months ago
On the Origin and Status of our Conception of Number
Abstract This paper concerns the epistemic status of "Hume's principle"-the assertion that for any concepts Fand G, the number of Fs is the same as the number of Gs ...
William Demopoulos
COMBINATORICS
1998
63views more  COMBINATORICS 1998»
13 years 9 months ago
On Kissing Numbers in Dimensions 32 to 128
An elementary construction using binary codes gives new record kissing numbers in dimensions from 32 to 128.
Yves Edel, Eric M. Rains, Neil J. A. Sloane
NN
1998
Springer
13 years 9 months ago
Statistical estimation of the number of hidden units for feedforward neural networks
The number of required hidden units is statistically estimated for feedforward neural networks that are constructed by adding hidden units one by one. The output error decreases w...
Osamu Fujita
NETWORKS
2010
13 years 8 months ago
Mixed search number and linear-width of interval and split graphs
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
Fedor V. Fomin, Pinar Heggernes, Rodica Mihai