989 search results - page 101 / 198 » Approximating the Pareto optimal set using a reduced set of ... |
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
SIAMJO
2002
13 years 7 months ago
2002
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
EMO
2003
Springer
14 years 1 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...