Sciweavers

4430 search results - page 458 / 886
» Solving Optimization Problems with DLL
Sort
View
ECCV
1998
Springer
16 years 8 months ago
A Solution for the Registration of Multiple 3D Point Sets Using Unit Quaternions
Registering 3D point sets is a common problem in computer vision. The case of two point sets has been analytically well solved by several authors. In this paper we present an analy...
Raouf Benjemaa, Francis Schmitt
CEC
2008
IEEE
16 years 25 days ago
A study on constrained MA using GA and SQP: Analytical vs. finite-difference gradients
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
Stephanus Daniel Handoko, Chee Keong Kwoh, Yew-Soo...
DAGM
2005
Springer
15 years 12 months ago
A Novel Parameter Decomposition Approach to Faithful Fitting of Quadric Surfaces
This paper addresses a common problem in dealing with range images. We propose a novel method to fit surfaces of known types via a parameter decomposition approach. This approach ...
Xiaoyi Jiang, Da-Chuan Cheng
ATMOS
2007
119views Optimization» more  ATMOS 2007»
15 years 8 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
172
Voted
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 6 months ago
Fast Overlapping Group Lasso
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
Jun Liu, Jieping Ye