92 search results - page 9 / 19 » On Maximal S-Free Convex Sets |
TCOM
2010
14 years 10 months ago
2010
—Resource allocation promises significant benefits in wireless networks. In order to fully reap these benefits, it is important to design efficient resource allocation algori...
FSS
2010
14 years 10 months ago
2010
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
104
click to vote
COR
2002
14 years 11 months ago
2002
This paper presents the fundamental theory and algorithms for identifying the most preferred alternative for a decision maker (DM) having a non-centrist (or extremist) preferentia...
NIPS
2001
15 years 1 months ago
2001
When constructing a classifier, the probability of correct classification of future data points should be maximized. In the current paper this desideratum is translated in a very ...
PKDD
2009
Springer
15 years 6 months ago
2009
Springer
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...