Abstract: Lempel-Ziv complexity (LZC) is an algorithm used to quantify the complexity of a data sequence by calculating the number of independent substrings contained in the sequence. LZC succeeds in ...
Abstract: This paper presents a time-causal analogue of the Gabor filter, as well as a both time-causal and time-recursive analogue of the Gabor transform, where the proposed time-causal ...
New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science. But the way to do it, according to Cameron Seth, a Ph.D. researcher ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback