61 search results - page 7 / 13 » An empirical study of a scalable Byzantine agreement algorit... |
83
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
99
Voted
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
PAMI
2011
14 years 4 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
96
Voted
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
100
click to vote
JMLR
2012
13 years 2 days ago
2012
In this paper, we propose to apply sparse canonical correlation analysis (sparse CCA) to an important genome-wide association study problem, eQTL mapping. Existing sparse CCA mode...