Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
In visualising multidimensional data, it is well known that different types of data require different types of algorithms to process them. Data sets might be distinguished accordi...
The Stack algorithm, which is a best-first search algorithm widely used in speech recognition, is modified for application to the problem of recognizing machine printed text in th...
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
Before the advent of Hidden Markov Models(HMM)-based speech recognition, many speech applications were built using pattern matching algorithms like the Dynamic Time Warping (DTW) ...