287 search results - page 55 / 58 » Optimal Solutions for Sparse Principal Component Analysis |
111
click to vote
SIAMJO
2010
14 years 8 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
In [12] we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. In this demo we show how this architecture is le...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
CINQ
2004
Springer
15 years 3 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
HIS
2007
14 years 11 months ago
2007
Genetic programming is known to provide good solutions for many problems like the evolution of network protocols and distributed algorithms. In such cases it is most likely a hard...