1511 search results - page 41 / 303 » Randomness, lowness and degrees |
106
click to vote
ARSCOM
2004
15 years 1 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
ISCAS
2006
IEEE
15 years 8 months ago
2006
IEEE
— By implementing an FPGA-based simulator, we investigate the performance of high-rate quasi-cyclic (QC) LDPC codes for the magnetic recording channel at very low sector error ra...
121
click to vote
PCI
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an impr...
123
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract--We consider the problem of recovering a lowrank matrix when some of its entries, whose locations are not known a priori, are corrupted by errors of arbitrarily large magn...
125
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We prove that for any real-valued matrix X ∈ Rm×n , and positive integers r k, there is a subset of r columns of X such that projecting X onto their span gives a r+1 r−k+1 -a...