104 search results - page 15 / 21 » Efficient Algorithms for k Maximum Sums |
MCS
2005
Springer
15 years 3 months ago
2005
Springer
Mixed Group Ranks is a parametric method for combining rank based classi ers that is eective for many-class problems. Its parametric structure combines qualities of voting methods...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
COLOGNETWENTE
2008
14 years 11 months ago
2008
We consider combinatorial optimization problems arising in radiation therapy. Given a matrix I with non-negative integer entries, we seek for a decomposition of I as a weighted su...
101
click to vote
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
ICMLA
2009
14 years 7 months ago
2009
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...