This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
This paper proposes a novel nonlinear discriminant analysis method named by Kernerlized Maximum Average Margin Criterion (KMAMC), which has combined the idea of Support Vector Mac...
—The problem of variable sample rate conversion (SRC) has received much attention on account of its applications in software defined radios (SDRs) that must support a wide varie...
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...