We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Ensemble methods have proved to be highly effective in improving the performance of base learners under most circumstances. In this paper, we propose a new algorithm that combine...
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...
— In this paper a clustering algorithm that learns the groups of synchronized spike trains directly from data is proposed. Clustering of spike trains based on the presence of syn...
This paper describes our investigation into the neural gas (NG) network algorithm and the hierarchical overlapped architecture (HONG) which we have built by retaining the essence ...