4488 search results - page 328 / 898 » Properties of NP-Complete Sets |
169
click to vote
IJCV
2006
15 years 6 months ago
2006
We address the issue of low-level segmentation of vector-valued images, focusing on the case of color natural images. The proposed approach relies on the formulation of the problem...
189
click to vote
IJFCS
2006
15 years 6 months ago
2006
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
176
click to vote
STTT
2008
15 years 6 months ago
2008
Abstract. Fast is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under stud...
140
click to vote
TALG
2008
15 years 6 months ago
2008
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...
140
click to vote
DM
2002
15 years 6 months ago
2002
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...