Sciweavers

1149 search results - page 41 / 230
» Minimally non-Pfaffian graphs
Sort
View
ACSAC
2003
IEEE
15 years 5 months ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...
ACCV
2010
Springer
14 years 6 months ago
A Convex Image Segmentation: Extending Graph Cuts and Closed-Form Matting
Abstract. Image matting and segmentation are two closely related topics that concern extracting the foreground and background of an image. While the methods based on global optimiz...
Youngjin Park, Suk I. Yoo
TALG
2008
115views more  TALG 2008»
14 years 11 months ago
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in
Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatki...
ACIVS
2007
Springer
15 years 6 months ago
Joint Tracking and Segmentation of Objects Using Graph Cuts
This paper presents a new method to both track and segment objects in videos. It includes predictions and observations inside an energy function that is minimized with graph cuts. ...
Aurélie Bugeau, Patrick Pérez
ISVC
2005
Springer
15 years 5 months ago
Image Smoothing and Segmentation by Graph Regularization
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which leads to a family of nonlinear filters, such as the bilateral filter or the TV digi...
Sébastien Bougleux, Abderrahim Elmoataz