985 search results - page 141 / 197 » Piercing Convex Sets |
ICML
2006
IEEE
14 years 11 months ago
2006
IEEE
We present a new, statistical approach to rule learning. Doing so, we address two of the problems inherent in traditional rule learning: The computational hardness of finding rule...
ICML
2006
IEEE
14 years 11 months ago
2006
IEEE
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
IPSN
2010
Springer
14 years 4 months ago
2010
Springer
This paper develops algorithms to train linear support vector machines (SVMs) when training data are distributed across different nodes and their communication to a centralized no...
IMR
2004
Springer
14 years 3 months ago
2004
Springer
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
CPAIOR
2010
Springer
14 years 2 months ago
2010
Springer
Interval coefficients have been introduced in OR and CP to specify uncertain data in order to provide reliable solutions to convex models. The output is generally a solution set, ...