361 search results - page 15 / 73 » Relaxed Gabriel Graphs |
ECEASST
2008
13 years 7 months ago
2008
fy and Verify Data Abstractions Luciano Baresi, Carlo Ghezzi, Andrea Mocci and Mattia Monga 14 pages Guest Editors: Claudia Ermel, Reiko Heckel, Juan de Lara Managing Editors: Tizi...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
IVC
2007
13 years 7 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
EMMCVPR
2005
Springer
14 years 1 months ago
2005
Springer
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
FM
2009
Springer
14 years 3 days ago
2009
Springer
The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between faulttolerance requirements and timing constraints. In this ...