Efficient Algorithms for In-memory Sorting, Searching and Indexing on Modern Multi-core Cache-based and Graphics Processor Architectures. This project clearly belongs to one of the national research priority
goals, Smart Information Use. The copy-based techniques and work on sorting and searching will considerably impact the development of in-memory algorithms in cutting-edge computer architectures. Efficient suffix trees and suffix sorting have myriad applications in string-processing and will ....Efficient Algorithms for In-memory Sorting, Searching and Indexing on Modern Multi-core Cache-based and Graphics Processor Architectures. This project clearly belongs to one of the national research priority
goals, Smart Information Use. The copy-based techniques and work on sorting and searching will considerably impact the development of in-memory algorithms in cutting-edge computer architectures. Efficient suffix trees and suffix sorting have myriad applications in string-processing and will be of high interest to bioinformatics companies. The sortdex project will develop novel algorithms that will be used by enterprise search engine companies to develop applications for libraries and organisations dealing with large databases. Algorithms using the graphics processor as a co-processor have important applications in the high-growth field of computer graphics and games. Read moreRead less
Approximate proximity for applications in data mining and visualization. Data Mining, pattern recognition and visualization of relational information are all important data analysis techniques in which it is essential to determine which data points are in the vicinity of others. The huge size of the data sets involved and the need for real-time interaction preclude the use of conventional methods for the precise computation of the proximity information required. This project will develop efficie ....Approximate proximity for applications in data mining and visualization. Data Mining, pattern recognition and visualization of relational information are all important data analysis techniques in which it is essential to determine which data points are in the vicinity of others. The huge size of the data sets involved and the need for real-time interaction preclude the use of conventional methods for the precise computation of the proximity information required. This project will develop efficient algorithms and data structures for gathering high-quality approximations of the full proximity information, and will use these innovations as the basis for new, practical tools for visualization, and clustering in data mining.Read moreRead less