446 search results - page 14 / 90 » A fast algorithm for computing steiner edge connectivity |
178
click to vote
ICDAR
2011
IEEE
13 years 9 months ago
2011
IEEE
—In this paper, we present a novel approach for super-resolved binarization of document images acquired by low quality devices. The algorithm tries to compute the super resolutio...
ICCSA
2004
Springer
15 years 3 months ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
ICPR
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
60
Voted
CEC
2009
IEEE
15 years 2 months ago
2009
IEEE
—Glomerulus is the filtering unit of the kidney. In the computer aided diagnosis system designed for kidney disease, glomerulus extraction is an important step for analyzing kidn...