10 search results - page 2 / 2 » Calibrating Computational Feasibility by Abstraction Rank |
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
ECCV
2000
Springer
14 years 7 months ago
2000
Springer
Abstract. In his paper we introduce two improvements to the threedimensional gamut mapping approach to computational colour constancy. This approach consist of two separate parts. ...
VLDB
2008
ACM
14 years 5 months ago
2008
ACM
The evolution of computing technology suggests that it has become more feasible to offer access to Web information in a ubiquitous way, through various kinds of interaction device...
ACCV
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
EC
2011
13 years 7 days ago
2011
Abstract—In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with ...