Sciweavers

512 search results - page 4 / 103
» The Lifted Newton Method and Its Application in Optimization
Sort
View
EOR
2008
79views more  EOR 2008»
13 years 8 months ago
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
Konstantinos Kaparis, Adam N. Letchford
BMCBI
2006
146views more  BMCBI 2006»
13 years 8 months ago
Optimized Particle Swarm Optimization (OPSO) and its application to artificial neural network training
Background: Particle Swarm Optimization (PSO) is an established method for parameter optimization. It represents a population-based adaptive optimization technique that is influen...
Michael Meissner, Michael Schmuker, Gisbert Schnei...
ICASSP
2011
IEEE
13 years 15 days ago
Application specific loss minimization using gradient boosting
Gradient boosting is a flexible machine learning technique that produces accurate predictions by combining many weak learners. In this work, we investigate its use in two applica...
Bin Zhang, Abhinav Sethy, Tara N. Sainath, Bhuvana...
CVPR
2006
IEEE
14 years 10 months ago
Kernel-based Template Alignment
This paper introduces a novel kernel-based method for template tracking in video sequences. The method is derived for a general warping transformation, and its application to affi...
Igor Guskov
NIPS
2007
13 years 10 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...