1088 search results - page 89 / 218 » A Bayesian Approach to Tackling Hard Computational Problems |
CEC
2007
IEEE
14 years 4 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
ECCV
2006
Springer
15 years 9 days ago
2006
Springer
Abstract. This paper addresses the problem of how to learn an appropriate feature representation from video to benefit video-based face recognition. By simultaneously exploiting th...
PODC
2004
ACM
14 years 3 months ago
2004
ACM
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
BIRTHDAY
2012
Springer
12 years 6 months ago
2012
Springer
Abstract. Model-Driven Engineering (MDE) places models as firstclass artifacts throughout the software lifecycle. In this context, model transformations are crucial for the succes...
ECAI
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...