165 search results - page 2 / 33 » An optimal maximal independent set algorithm for bounded-ind... |
ICTCS
2003
Springer
13 years 10 months ago
2003
Springer
SSPR
2004
Springer
13 years 10 months ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
GBRPR
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
AUSAI
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. This note describes a method for computation of non-redundant bases of attribute implications from data tables with fuzzy attributes. Attribute implications are formulas ...
ESA
1998
Springer
13 years 9 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...