The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
K nearest neighbor classifier (K-NN) is widely discussed and applied in pattern recognition and machine learning, however, as a similar lazy classifier using local information for...
Remote visualization of an arbitrary 2-D planar "cut" from a large volumetric dataset with random access has both gained importance and posed significant challenges over...
The objective of this paper is twofold. The first part provides further insight in the statistical properties of the Welch power spectrum estimator. A major drawback of the Welch m...
—LDA transformation is one of the popular feature dimension reduction techniques for the feature extraction in most handwritten Chinese characters recognition systems. The integr...