725 search results - page 71 / 145 » Bounding Degrees on RPL |
LATIN
2010
Springer
14 years 6 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
CORR
2011
Springer
13 years 6 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
CORR
2011
Springer
13 years 6 months ago
2011
Springer
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...
TIT
2011
13 years 6 months ago
2011
— The focus of this paper is on spatial precoding in correlated multi-antenna channels where the number of datastreams is adapted independent of the number of transmit antennas. ...
SIAMNUM
2010
13 years 5 months ago
2010
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...