We present a new polynomially solvable case of the Quadratic Assignment Problem in Koopmans-Beckman form QAP(A,B), by showing that the identity permutation is optimal when A and B are respectively a Robinson similarity and dissimilarity matrix and one of A or B is a Toeplitz matrix. A Robinson (dis)similarity matrix is a symmetric matrix whose entries (increase) decrease monotonically along row...

In recent years, some spectral feature selection methods are proposed to choose those features with high power of preserving sample similarity. However, when there exist lots of irrelevant or noisy features in data, the similarity matrix constructed from all the un-weighted features may be not reliable, which then misleads existing spectral feature selection methods to select ’wrong’ features. ...

Crowdsourcing utilizes human ability by distributing tasks to a large number of workers. It is especially suitable for solving data clustering problems because it provides a way to obtain a similarity measure between objects based on manual annotations, which capture the human perception of similarity among objects. This is in contrast to most clustering algorithms that face the challenge of fi...

Can we characterize the wavelets through linear transformation? the answer for this question is certainly YES. In this paper we have characterized the Haar wavelet matrix by their linear transformation and proved some theorems on properties of Haar wavelet matrix such as Trace, eigenvalue and eigenvector and diagonalization of a matrix.

In this paper, we propose to cluster and model network-level traffic states based on a geometrical weighted similarity measure of network-level traffic states and locality preservative non-negative matrix factorization. The geometrical weighted similarity measure makes use of correlation between neighboring roads to describe spatial configurations of global traffic patterns. Based on it, we pro...

Long audio alignment systems for Spanish and English are presented, within an automatic subtitling application. Language-specific phone decoders automatically recognize audio contents at phoneme level. At the same time, language-dependent grapheme-to-phoneme modules perform a transcription of the script for the audio. A dynamic programming algorithm (Hirschberg's algorithm) finds matches betwee...