Sciweavers

7840 search results - page 30 / 1568
» On generalized Ramsey numbers
Sort
View
MOC
2002
90views more  MOC 2002»
13 years 8 months ago
Explicit bounds and heuristics on class numbers in hyperelliptic function fields
Abstract. In this paper, we provide tight estimates for the divisor class number of hyperelliptic function fields. We extend the existing methods to any hyperelliptic function fiel...
Andreas Stein, Edlyn Teske
GLOBECOM
2009
IEEE
14 years 1 months ago
A Probabilistic Approach to Identifying the Number of Frequency Hoppers for Spectrum Sensing
Characterizing the number and type of transmitters occupying a given frequency band is a critical aspect of spectrum sensing specifically and cognitive radio generally. We present ...
Yuxing Han, Shaunak Joshi, Lillian Dai, Danijela C...
ICALP
2004
Springer
14 years 2 months ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry
ICA
2010
Springer
13 years 10 months ago
Adaptive Underdetermined ICA for Handling an Unknown Number of Sources
Independent Component Analysis is the best known method for solving blind source separation problems. In general, the number of sources must be known in advance. In many cases, pre...
Andreas Sandmair, Alam Zaib, Fernando Puente Le&oa...
COMBINATORICS
1999
61views more  COMBINATORICS 1999»
13 years 8 months ago
A Fibonacci-like Sequence of Composite Numbers
In 1964, Ronald Graham proved that there exist relatively prime natural numbers a and b such that the sequence {An} defined by An = An-1 + An-2 (n 2; A0 = a, A1 = b) contains no ...
John W. Nicol