1511 search results - page 20 / 303 » Randomness, lowness and degrees |
133
click to vote
APAL
2011
14 years 6 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...
EJC
2008
14 years 12 months ago
2008
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
102
click to vote
ICPR
2010
IEEE
14 years 9 months ago
2010
IEEE
This paper proposes an extension to the mean shift tracking. We introduce the color connectedness degrees (CCD) which, more than providing statistical information about the target...
101
Voted
IWSOC
2005
IEEE
15 years 5 months ago
2005
IEEE
A fully programmable radio baseband processor architecture is presented. The architecture is based on a DSP processor core and a number flexible accelerators, connected via a con...
CIE
2007
Springer
15 years 1 months ago
2007
Springer
This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. The main result is that every infinite sequence S with constructive Hausdorff...