Dependence-Free Clustering of Shift-Invariant Data Structures

Abstract

Dependence-free clustering of data structures can be regarded as a general form of alignment and addresses the problem of finding the maximum amount of independent computation on non-connected data sets. The paper presents a unified concept for modelling both data spaces and affine dependence relations with the help of Abelian subgroups of Z, n. This… (More)
DOI: 10.1007/BFb0002753

Topics

2 Figures and Tables

Slides referencing similar topics