11949 search results - page 2301 / 2390 » Some results on (a:b)-choosability |
105
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
118
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
103
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
The subject of this article is the long standing open problem of developing a general capacity theory for wireless networks, particularly a theory capable of describing the fundam...
111
click to vote
JMLR
2008
15 years 1 months ago
2008
Ensemble learning algorithms such as boosting can achieve better performance by averaging over the predictions of some base hypotheses. Nevertheless, most existing algorithms are ...
115
click to vote
JNW
2008
15 years 1 months ago
2008
Multi-path routing allows building and use of multiple paths for routing between a source-destination pair. This paper investigates the problem of selecting multiple routing paths ...