Sciweavers

7773 search results - page 3 / 1555
» On generalized Frame-Stewart numbers
Sort
View
IWCMC
2006
ACM
15 years 5 months ago
Bounds on the fading number of multiple-input single-output fading channels with memory
We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and...
Stefan M. Moser
135
Voted
LION
2009
Springer
125views Optimization» more  LION 2009»
15 years 6 months ago
New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
Samuel Rota Bulò, Marcello Pelillo
CIE
2007
Springer
15 years 5 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
67
Voted
JCT
2007
71views more  JCT 2007»
14 years 11 months ago
Divisibility of generalized Catalan numbers
We define a q generalization of weighted Catalan numbers studied by Postnikov and Sagan, and prove a result on the divisibility by p of such numbers when p is a prime and q its p...
Matjaz Konvalinka
66
Voted
MOC
2002
109views more  MOC 2002»
14 years 11 months ago
Distribution of generalized Fermat prime numbers
Numbers of the form Fb,n = b2n +1 are called Generalized Fermat Numbers (GFN). A computational method for testing the probable primality of
Harvey Dubner, Yves Gallot