6740 search results - page 103 / 1348 » An s -Hamiltonian Line Graph Problem |
WG
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
ICCAD
1998
IEEE
14 years 2 months ago
1998
IEEE
We lay out a theoretical framework to evaluate watermarking techniques for intellectual property protection (IPP). Based on this framework, we analyze two watermarking techniques ...
TIP
2010
13 years 4 months ago
2010
Abstract--Path openings and closings are morphological operations with flexible line segments as structuring elements. These line segments have the ability to adapt to local image ...
CVPR
2007
IEEE
14 years 4 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
FSTTCS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...