17760 search results - page 211 / 3552 » A Generalization of the Massey-Ding Algorithm |
112
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Multisource information theory in Shannon setting is well known. In this article we try to develop its algorithmic information theory counterpart and use it as the general framewo...
131
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks wit...
126
click to vote
PAMI
2008
15 years 4 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
120
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...
158
click to vote
COMPUTING
2008
15 years 4 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...