Sciweavers

1529 search results - page 57 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
151
Voted
EOR
2008
119views more  EOR 2008»
15 years 3 months ago
A General Vehicle Routing Problem
In this paper we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined ...
Asvin Goel, Volker Gruhn
120
Voted
JAT
2010
71views more  JAT 2010»
15 years 2 months ago
Functions with prescribed best linear approximations
A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In ...
Patrick L. Combettes, Noli N. Reyes
111
Voted
SIAMJO
2002
73views more  SIAMJO 2002»
15 years 3 months ago
Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
We study best approximation problems with nonlinear constraints in Hilbert spaces. The strong "conical hull intersection property" (CHIP) and the "basic constraint q...
Chong Li, Xiao-Qing Jin
122
Voted
ICML
2003
IEEE
16 years 4 months ago
Kernel PLS-SVC for Linear and Nonlinear Classification
A new method for classification is proposed. This is based on kernel orthonormalized partial least squares (PLS) dimensionality reduction of the original data space followed by a ...
Roman Rosipal, Leonard J. Trejo, Bryan Matthews
147
Voted
CVPR
2007
IEEE
16 years 5 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor