393 search results - page 39 / 79 » Convex Programming Methods for Global Optimization |
DLS
2010
13 years 5 months ago
2010
Dynamic mixin is a construct available in Ruby and other dynamic languages. It can be used as a base to implement a range of programming paradigms, such as dynamic aspectoriented ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
A new mutation concept is proposed to generalize local selection based Differential Evolution algorithm to work in general multimodal problems. Three variations of the proposed me...
SPEECH
2010
13 years 2 months ago
2010
act 11 We analyze and compare two different methods for unsupervised extractive spontaneous speech summarization in the meeting 12 domain. Based on utterance comparison, we introdu...
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
— A key step in many statistical learning methods used in machine learning involves solving a convex optimization problem containing one or more hyper-parameters that must be sel...
IPMI
2007
Springer
14 years 8 months ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...