Sciweavers

287 search results - page 47 / 58
» Optimal Solutions for Sparse Principal Component Analysis
Sort
View
DAC
2003
ACM
15 years 10 months ago
Optimal integer delay budgeting on directed acyclic graphs
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...
COLT
2005
Springer
15 years 3 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
73
Voted
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 1 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
GECCO
2009
Springer
15 years 4 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
MM
2006
ACM
203views Multimedia» more  MM 2006»
15 years 3 months ago
Learning image manifolds by semantic subspace projection
In many image retrieval applications, the mapping between highlevel semantic concept and low-level features is obtained through a learning process. Traditional approaches often as...
Jie Yu, Qi Tian