Sciweavers

3352 search results - page 469 / 671
» Hierarchical Problem Solving and the Bayesian Optimization A...
Sort
View
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
16 years 6 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...
SDM
2012
SIAM
273views Data Mining» more  SDM 2012»
13 years 8 months ago
A Framework for the Evaluation and Management of Network Centrality
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
Vatche Ishakian, Dóra Erdös, Evimaria ...
GECCO
2007
Springer
130views Optimization» more  GECCO 2007»
16 years 19 days ago
Variable discrimination of crossover versus mutation using parameterized modular structure
Recent work has provided functions that can be used to prove a principled distinction between the capabilities of mutation-based and crossover-based algorithms. However, prior fun...
Rob Mills, Richard A. Watson
CVPR
2006
IEEE
16 years 15 days ago
Active Graph Cuts
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
Olivier Juan, Yuri Boykov
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 10 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch