Sciweavers

4541 search results - page 428 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 5 months ago
A new approach to dynamic all pairs shortest paths
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...
Camil Demetrescu, Giuseppe F. Italiano
ICDM
2005
IEEE
179views Data Mining» more  ICDM 2005»
15 years 10 months ago
Bagging with Adaptive Costs
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...
Yi Zhang, W. Nick Street
CPM
2001
Springer
130views Combinatorics» more  CPM 2001»
15 years 9 months ago
On-Line Construction of Compact Directed Acyclic Word Graphs
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...
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohar...
IJCNN
2007
IEEE
15 years 11 months ago
Spectral Clustering of Synchronous Spike Trains
— 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...
António R. C. Paiva, Sudhir Rao, Il Park, J...
141
Voted
ICDAR
1999
IEEE
15 years 9 months ago
Combining Classifiers based on Confidence Values
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 ...
Ajantha S. Atukorale, Ponnuthurai N. Suganthan