225 search results - page 44 / 45 » On the Complexity of Approximating TSP with Neighborhoods an... |
SIGECOM
2006
ACM
13 years 11 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
Many vision problems can be cast as optimizing the conditional probability density function p(C|I) where I is an image and C is a vector of model parameters describing the image. ...
ICDCN
2009
Springer
14 years 1 days ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
AML
2008
13 years 5 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
In this paper, we propose a new method to construct an edge-preserving filter which has very similar response to the bilateral filter. The bilateral filter is a normalized convolu...