446 search results - page 16 / 90 » A fast algorithm for computing steiner edge connectivity |
DMGT
2011
14 years 1 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
COMPUTING
2006
14 years 9 months ago
2006
We consider the problem of splitting a symmetric positive definite (SPD) stiffness matrix A arising from finite element discretization into the sum of edge matrices thereby assumi...
104
Voted
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
ICIP
2007
IEEE
15 years 11 months ago
2007
IEEE
We introduce a framework for image enhancement, which smooths images while preserving edge information. Domain (spatial) and range (feature) information are combined in one single...
ICIP
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper we present a new optimization technique for the neighborhood computation in connected component labeling focused on images stored in raster scan order. This new tech...