Uncertainty principles and signal recovery
SIAM Journal on Applied Mathematics
A maximum entropy approach to interpolation
Signal Processing
Data communications principles
Data communications principles
Recovery of blocky images from noisy and blurred data
SIAM Journal on Applied Mathematics
Combining frequency and spatial domain information for fast interactive image noise removal
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Communications of the ACM
Adaptive Image Reconstruction Using Information Measures
SIAM Journal on Control and Optimization
Parallel and Distributed Computing: A Survey of Models, Paradigms and Approaches
Parallel and Distributed Computing: A Survey of Models, Paradigms and Approaches
Distributed Algorithms
Artficial Immune Systems and Their Applications
Artficial Immune Systems and Their Applications
Comparison of Symbol Sequences: No Editing, No Alignment
Open Systems & Information Dynamics
Information Capacity of Symbol Sequences
Open Systems & Information Dynamics
Grammar specialization through entropy thresholds
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Massively distributed systems: design issues and challenges
WOES'99 Proceedings of the Workshop on Embedded Systems on Workshop on Embedded Systems
Detection of missing data in image sequences
IEEE Transactions on Image Processing
Interpolation of missing data in image sequences
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
The new method of a gap recovery in symbol sequences is presented. A covering is combined from the suitable reasonably short strings of the parts of a sequence available for observation. Two criteria are introduced to choose the best covering. It must yield the maximum of entropy of a frequency dictionary developed over the sequence obtained due to the recovery, if an overlapping combined from the copies of strings from the available parts of the sequence exists. The second criterion identifies the best covering in case when one has to use any string to cover the gap; here the best covering must yield the minimum of specific entropy of the frequency dictionary developed over the available parts of the sequence against the one developed over the entire sequence obtained due to the recovery. Kirdin kinetic machine which is the ideal fine-grained structureless computer has been used to resolve the problem of the reconstruction of a gap in symbol sequence.