1149 search results - page 145 / 230 » Minimally non-Pfaffian graphs |
160
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
181
click to vote
ECCV
2008
Springer
15 years 8 months ago
2008
Springer
Active contour formulations predominate current minimization of the Mumford-Shah functional (MSF) for image segmentation and filtering. Unfortunately, these formulations necessitat...
154
click to vote
IPL
2007
15 years 6 months ago
2007
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...
149
click to vote
TIP
2008
15 years 6 months ago
2008
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...
142
click to vote
TSE
2008
15 years 6 months ago
2008
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...