3946 search results - page 474 / 790 » The computational complexity of choice sets |
222
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
186
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
195
click to vote
COLING
2010
15 years 1 months ago
2010
Machine-learned ranking techniques automatically learn a complex document ranking function given training data. These techniques have demonstrated the effectiveness and flexibilit...
177
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
This paper deals with the automated creation of geometric and photometric correct 3-D models of the world. Those models can be used for virtual reality, tele? presence, digital ci...
178
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
This paper describes a head-tracking algorithm that is based on recognition and correlation-based weighted interpolation. The input is a sequence of 3D depth images generated by a...