4342 search results - page 137 / 869 » Improved Algorithms for Optimal Embeddings |
133
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
183
click to vote
EC
2007
15 years 4 months ago
2007
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
165
click to vote
NIPS
2001
15 years 5 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
144
click to vote
EMO
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. While Single-Objective Evolutionary Algorithms (EAs) parallelization schemes are both well established and easy to implement, this is not the case for Multi-Objective Evo...
152
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Genetic Programming offers freedom in the definition of the cost function that is unparalleled among supervised learning algorithms. However, this freedom goes largely unexploited...