1576 search results - page 162 / 316 » Properties of Synthetic Optimization Problems |
171
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
In this paper we explore avenues for improving the reliability of dimensionality reduction methods such as Non-Negative Matrix Factorization (NMF) as interpretive exploratory data...
179
click to vote
TEC
2008
15 years 6 months ago
2008
Under mild conditions, it can be induced from the Karush-Kuhn-Tucker condition that the Pareto set, in the decision space, of a continuous multiobjective optimization problem is (m...
160
click to vote
DAM
1998
15 years 6 months ago
1998
We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...
254
click to vote
JMLR
2010
15 years 1 months ago
2010
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
186
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...