Sciweavers

7602 search results - page 1320 / 1521
» A New Approach to Base Revision
Sort
View
GECCO
2008
Springer
158views Optimization» more  GECCO 2008»
15 years 7 months ago
Objective reduction using a feature selection technique
This paper introduces two new algorithms to reduce the number of objectives in a multiobjective problem by identifying the most conflicting objectives. The proposed algorithms ar...
Antonio López Jaimes, Carlos A. Coello Coel...
ICML
2010
IEEE
15 years 7 months ago
A scalable trust-region algorithm with application to mixed-norm regression
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
CVPR
2010
IEEE
15 years 6 months ago
Learning kernels for variants of normalized cuts: Convex relaxations and applications
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
Lopamudra Mukherjee, Vikas Singh, Jiming Peng, Chr...
RECSYS
2010
ACM
15 years 6 months ago
Beyond accuracy: evaluating recommender systems by coverage and serendipity
When we evaluate the quality of recommender systems (RS), most approaches only focus on the predictive accuracy of these systems. Recent works suggest that beyond accuracy there i...
Mouzhi Ge, Carla Delgado-Battenfeld, Dietmar Janna...
HPDC
2010
IEEE
15 years 6 months ago
Toward high performance computing in unconventional computing environments
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
Brent Rood, Nathan Gnanasambandam, Michael J. Lewi...
« Prev « First page 1320 / 1521 Last » Next »