VEXPA: Validated EXPonential Analysis through regular sub-sampling
نویسندگان
چکیده
منابع مشابه
VEXPA: Validated EXPonential Analysis through regular sub-sampling
In signal processing data are traditionally sampled according to the Shannon-Nyquist theorem in order to prevent aliasing effects. Here we focus on parametric methods and introduce a procedure that allows these methods to work with sub-sampled data. We actually make use of the aliasing effect to regularize the problem statement rather than that we avoid it. The new approach adds a number of fea...
متن کاملCluster Stability Analysis using Sub-sampling
Cluster stability research is involved with the validity of clusters generated by a clustering algorithm. In other words, it answers whether generated clusters are true clusters or due to chance. Estimating true numbers of clusters is related to this problem, since often the cluster validity is based on this estimate. In the literature, there are a number of methods available for both purposes....
متن کاملStatic Analysis for Regular Expression Exponential Runtime via Substructural Logics
Regular expression matching using backtracking can have exponential runtime, leading to an algorithmic complexity attack known as REDoS in the systems security literature. In this paper, we present a static analysis that detects whether a given regular expression can have exponential runtime for some inputs. The analysis works by forming powers and products of transition relations and thereby r...
متن کاملHandwritten character recognition through two-stage foreground sub-sampling
In this paper, we present a methodology for off-line handwritten character recognition. The proposed methodology relies on a new feature extraction technique based on recursive subdivisions of the character image so that the resulting sub-images at each iteration have balanced (approximately equal) numbers of foreground pixels, as far as this is possible. Feature extraction is followed by a two...
متن کاملValidated Compilation through Logic
To reason about programs written in a language, one needs to define its formal semantics, derive a reasoning mechanism (e.g. a program logic), and maximize the proof automation. Unfortunately, a compiler may involve multiple languages and phases; it is tedious and error prone to do so for each language and each phase. We present an approach based on the use of higher order logic to ease this bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing
سال: 2020
ISSN: 0165-1684
DOI: 10.1016/j.sigpro.2020.107722