413 search results - page 20 / 83 » On space constrained set selection problems |
INFORMS
1998
13 years 7 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Manually labeled landmark sets are often required as in-
puts for landmark-based image registration. Identifying an
optimal subset of landmarks from a training dataset may be
us...
JMLR
2008
13 years 7 months ago
2008
We show that the relevant information of a supervised learning problem is contained up to negligible error in a finite number of leading kernel PCA components if the kernel matche...
EOR
2006
13 years 7 months ago
2006
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
JCSS
2002
13 years 7 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...