Sciweavers

2314 search results - page 245 / 463
» Minimal Partitions of a Graph
Sort
View
ECCV
2008
Springer
15 years 6 months ago
Reformulating and Optimizing the Mumford-Shah Functional on a Graph - A Faster, Lower Energy Solution
Active contour formulations predominate current minimization of the Mumford-Shah functional (MSF) for image segmentation and filtering. Unfortunately, these formulations necessitat...
Leo Grady, Christopher V. Alvino
IPL
2007
76views more  IPL 2007»
15 years 4 months ago
Minimum cost subpartitions in graphs
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
Hiroshi Nagamochi, Yoko Kamidoi
TIP
2008
130views more  TIP 2008»
15 years 4 months ago
Nonlocal Discrete Regularization on Weighted Graphs: A Framework for Image and Manifold Processing
We introduce a nonlocal discrete regularization framework on weighted graphs of the arbitrary topologies for image and manifold processing. The approach considers the problem as a...
Abderrahim Elmoataz, Olivier Lezoray, Sébas...
TSE
2008
113views more  TSE 2008»
15 years 4 months ago
Discovering Neglected Conditions in Software by Mining Dependence Graphs
Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach for revealing neglected conditions that integrates stati...
Ray-Yaung Chang, Andy Podgurski, Jiong Yang
DAM
2000
137views more  DAM 2000»
15 years 4 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...