92 search results - page 4 / 19 » On Maximal S-Free Convex Sets |
87
Voted
WIOPT
2010
IEEE
14 years 7 months ago
2010
IEEE
We consider the resource allocation (RA) problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each ba...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
NIPS
2003
14 years 11 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
69
Voted
TIT
2011
14 years 4 months ago
2011
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
72
Voted
ISIPTA
2003
IEEE
15 years 2 months ago
2003
IEEE
Let be a preference relation on a convex set F. Necessary and sufficient conditions are given that guarantee the existence of a set {ul} of affine utility functions on F such th...