4894 search results - page 663 / 979 » The Guarding Problem - Complexity and Approximation |
143
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
159
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
As a well known fixed-point iteration algorithm for kernel
density mode-seeking, Mean-Shift has attracted wide attention
in pattern recognition field. To date, Mean-Shift algorit...
147
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
130
click to vote
ECCV
1996
Springer
16 years 5 months ago
1996
Springer
In this paper we describe a method to perform Euclidean reconstruction with a perspective camera model. It incrementally performs reconstruction with a paraperspective camera in or...
149
click to vote
ICIP
2006
IEEE
16 years 5 months ago
2006
IEEE
In this paper, we address the problem of 3D Model transmission over error-prone channels using multiple description coding (MDC). The objective of MDC is to encode a source into m...