Coding Subset Shift by Subgroup Conjugacy

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towers, Conjugacy and Coding

We consider three theorems in ergodic theory concerning a fixed aperiodic measure preserving transformation σ of a Lebesgue probability space (X,A, μ) and show that these theorems are all equivalent. Two of these results concern the existence of a partition of the space X with special properties. The third theorem asserts that the conjugates of σ are dense in the uniform topology on the space o...

متن کامل

Subgroup conjugacy problem for Garside subgroups of Garside groups

We solve the subgroup conjugacy problem for parabolic subgroups and Garside subgroups of a Garside group, and we present deterministic algorithms. This solution may be improved by using minimal simple elements. For standard parabolic subgroups of Garside groups we provide e ective algorithms for computing minimal simple elements.

متن کامل

Subgroup Separability and Conjugacy Separability of Certain HNN Extensions

In this note, we give characterizations for certain HNN extensions of polycyclic-by-finite groups with central associated subgroups to be subgroup separable and conjugacy separable. We shall do this by showing the equivalence of subgroup separability and conjugacy separability in this type of HNN extensions. 2000 Mathematics Subject Classification: Primary 20E06, 20E26; Secondary 20F10, 20F19

متن کامل

On Shift-Invariant Sparse Coding

The goals of this paper are: 1) the introduction of a shiftinvariant sparse coding model together with learning rules for this model; 2) the comparison of this model to the traditional sparse coding model; and 3) the analysis of some limitations of the newly proposed approach. To evaluate the model we will show that it can learn features from a toy problem as well as note-like features from a p...

متن کامل

Generalized bitplane-by-bitplane shift method for JPEG2000 ROI coding

One interesting feature of the new JPEG2000 image coding standard is support of region of interest (ROI) coding using the maximum shift (Maxshift) method, which allows for arbitrarily shaped ROI image compression without shape coding or explicitly transmitting any shape information to the decoder. The major disadvantage of the Maxshift method is that it cannot adjust the scaling value which det...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the London Mathematical Society

سال: 2000

ISSN: 0024-6093

DOI: 10.1112/s0024609300007463