6251 search results - page 15 / 1251 » Randomness, Computability, and Density |
IPCO
2004
13 years 10 months ago
2004
Let P be a random 0/1-polytope in d with n(d) vertices, and denote by k(P) the k-face density of P, i.e., the quotient of the number of k-dimensional faces of P and `n(d) k+1
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper we consider the problem of semiblind carrier frequency offset (CFO) estimation for OFDM systems. Specifically, we consider a synchronization scheme based on the ...
AAAI
2008
13 years 11 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
ISCA
2010
IEEE
14 years 1 months ago
2010
IEEE
Phase change memory (PCM) is an emerging memory technology for future computing systems. Compared to other non-volatile memory alternatives, PCM is more matured to production, and...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...