Abstract--In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes. We start from a simple graph-based encoding method "label-and-decide." W...
The paper introduces a new detectability concept for continuous-time Markov jump linear systems with finite Markov space that generalizes previous concepts found in the literature....
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Recently SVMs using spatial pyramid matching (SPM)
kernel have been highly successful in image classification.
Despite its popularity, these nonlinear SVMs have a complexity
O(n...
Jianchao Yang, Kai Yu, Yihong Gong, Thomas S. Huan...
The Fisher Linear Discriminant (FLD) is commonly used in pattern recognition. It finds a linear subspace that maximally separates class patterns according to Fisher's Criteri...