Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
Node Splitting Algorithms In Tree-Structured High-Dimensional Indexes For Similarity Search, Yongjian Fu, Jui Che Teng, S. R. Subramanya
Node Splitting Algorithms In Tree-Structured High-Dimensional Indexes For Similarity Search, Yongjian Fu, Jui Che Teng, S. R. Subramanya
Computer Science Faculty Research & Creative Works
Content-based searches and retrievals in multimedia and image databases use high-dimensional indexing structures for organizing the features of the objects. Most of those index structures are tree-structured whose nodes have a limit on the number of entries describing the subtrees rooted at those nodes. When index trees are built by repeated insertion of entries, nodes need to be split and the tree balanced accordingly. Node-splitting algorithms eventually determine the final structure of the tree which will have a profound effect on the search performance. This paper presents a comparative study of several node splitting algorithms for a typical high-dimensional indexing …
A Distributed Discrete-Time Neural Network Architecture For Pattern Allocation And Control, A.T. Chronopoulos, Jagannathan Sarangapani
A Distributed Discrete-Time Neural Network Architecture For Pattern Allocation And Control, A.T. Chronopoulos, Jagannathan Sarangapani
Computer Science Faculty Research & Creative Works
No abstract provided.