Sciweavers

1578 search results - page 76 / 316
» Algorithmic randomness of continuous functions
Sort
View
CVPR
2011
IEEE
14 years 1 months ago
TaylorBoost: First and Second-order Boosting Algorithms with Explicit Margin Control
A new family of boosting algorithms, denoted TaylorBoost, is proposed. It supports any combination of loss function and first or second order optimization, and includes classical...
Mohammad Saberian, Hamed Masnadi-Shirazi, Nuno Vas...
CORR
2006
Springer
146views Education» more  CORR 2006»
14 years 9 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram
ICANNGA
2007
Springer
15 years 1 months ago
Particle Swarms for Multimodal Optimization
Abstract. In this paper, five previous Particle Swarm Optimization (PSO) algorithms for multimodal function optimization are reviewed. A new and a successful PSO based algorithm, n...
Ender Özcan, Murat Yilmaz
PAMI
2010
215views more  PAMI 2010»
14 years 8 months ago
Fusion Moves for Markov Random Field Optimization
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
15 years 3 months ago
Giant Component and Connectivity in Geographical Threshold Graphs
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus