Sciweavers

36781 search results - page 27 / 7357
» Parameterizing by the Number of Numbers
Sort
View
ARITH
1995
IEEE
13 years 11 months ago
Semi-Logarithmic Number Systems
—We present a new class of number systems, called Semi-Logarithmic Number Systems, that constitute a family of various compromises between floating-point and logarithmic number s...
Jean-Michel Muller, Arnaud Tisserand, Alexandre Sc...
JCT
2006
79views more  JCT 2006»
13 years 7 months ago
Reciprocity for multirestricted Stirling numbers
Multirestricted Stirling numbers of the second kind count the number of partitions of a given set into a given number of parts, each part being restricted to at most a fixed number...
Ji Young Choi, Ling Long, Siu-Hung Ng, Jonathan Sm...
AML
2005
73views more  AML 2005»
13 years 7 months ago
Strong reducibility of partial numberings
A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numberin...
Dieter Spreen
CORR
2004
Springer
102views Education» more  CORR 2004»
13 years 7 months ago
The asymptotic number of binary codes and binary matroids
: The asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids.
Marcel Wild
MP
2010
149views more  MP 2010»
13 years 6 months ago
Copositive programming motivated bounds on the stability and the chromatic numbers
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
Igor Dukanovic, Franz Rendl