446 search results - page 31 / 90 » A fast algorithm for computing steiner edge connectivity |
90
Voted
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a novel algorithm for unsupervised texture segmentation. The proposed algorithm incorporates the Local Binary Pattern operator under a segmentation framework b...
162
Voted
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper, we propose a novel type of explicit image filter - guided filter. Derived from a local linear model, the guided filter generates the filtering output b...
94
Voted
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
CIAC
2000
Springer
15 years 2 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
68
Voted
ICCS
2003
Springer
15 years 2 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...