3244 search results - page 87 / 649 » On convex complexity measures |
106
click to vote
ICPR
2004
IEEE
16 years 2 months ago
2004
IEEE
A measure of stability for a wide class of pattern recognition algorithms is introduced to cope with overfitting in classification problems. Based on this concept, constructive me...
119
click to vote
INFOCOM
1999
IEEE
15 years 6 months ago
1999
IEEE
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth res...
109
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
ORDER
2000
15 years 1 months ago
2000
We prove that, given a nontrivial Boolean algebra B, a compact convex set S and a group G, there is an orthomodular lattice L with the center isomorphic to B, the automorphism grou...
101
click to vote
FS
2011
14 years 8 months ago
2011
[KLSX91] ensure the existence of the expected utility maximizer for investors with constant relative risk aversion coefficients less than one. In this note, we explain a simple tr...