4930 search results - page 48 / 986 » Learning minimal abstractions |
108
click to vote
ICIAR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this article we present the results of an unsupervised segmentation algorithm based on a multiresolution method. The algorithm uses color and edge information in an it...
97
Voted
ISCIS
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We show a two-phase approach for minimizing various communication-cost metrics in fine-grain partitioning of sparse matrices for parallel processing. In the first phase...
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are c...
79
Voted
FSTTCS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Two trees with the same number of leaves have to be embedded in two layers in the plane such that the leaves are aligned in two adjacent layers. Additional matching edges...
130
click to vote
IBPRIA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This article presents the results of an unsupervised segmentation algorithm in multispectral images. The algorithm uses a minimization function which takes into account e...