11 search results - page 2 / 3 » ce 2011 |
AML
2011
13 years 2 months ago
2011
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper we present two results on reducing the peak power of orthogonal frequency division multiplexing (OFDM) symbols via constellation extension (CE). The first result is...
APAL
2011
13 years 2 months ago
2011
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We introduce an algorithm that, given n objects, learns a similarity matrix over all n2 pairs, from crowdsourced data alone. The algorithm samples responses to adaptively chosen t...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper we first introduce four kinds of modification of Symmetric Scoring [1] which produce likelihood ratios that do not need to be explicitly normalized, i.e. T-norm, Z...