1691 search results - page 108 / 339 » Restricted subset selection |
SAGT
2010
Springer
13 years 8 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
IEEEPACT
2009
IEEE
13 years 7 months ago
2009
IEEE
As the gap between processor and memory continues to grow, memory performance becomes a key performance bottleneck for many applications. Compilers therefore increasingly seek to m...
ICRA
2009
IEEE
13 years 8 months ago
2009
IEEE
Abstract-- We propose a new method for automatically accessing an internet database of 3D models that are searchable only by their user-annotated labels, for using them for vision ...
TIP
2010
2010
Automatic Parameter Selection for Denoising Algorithms Using a No-Reference Measure of Image Content
13 years 4 months ago
Across the field of inverse problems in image and video processing, nearly all algorithms have various parameters which need to be set in order to yield good results. In practice, ...
TEC
2008
13 years 10 months ago
2008
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...