Instance-Based Learning Algorithms
Machine Learning
ACM Computing Surveys (CSUR)
An Effective Clustering Algorithm to Index High Dimensional Metric Spaces
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Overview of the Face Recognition Grand Challenge
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Similarity Search Using Sparse Pivots for Efficient Multimedia Information Retrieval
ISM '06 Proceedings of the Eighth IEEE International Symposium on Multimedia
Journal of Cognitive Neuroscience
Benchmarking GPUs to tune dense linear algebra
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
A Search Engine Index for Multimedia Content
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Parallel query processing on distributed clustering indexes
Journal of Discrete Algorithms
GPU-Quicksort: A practical Quicksort algorithm for graphics processors
Journal of Experimental Algorithmics (JEA)
Scheduling Metric-Space Queries Processing on Multi-Core Processors
PDP '10 Proceedings of the 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing
Distributing a Metric-Space Search Index onto Processors
ICPP '10 Proceedings of the 2010 39th International Conference on Parallel Processing
A graphics hardware accelerated algorithm for nearest neighbor search
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Improving the speed and stability of the k-nearest neighbors method
Pattern Recognition Letters
Load Balancing Query Processing in Metric-Space Similarity Search
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Range query processing on single and multi GPU environments
Computers and Electrical Engineering
Hi-index | 0.00 |
Information retrieval from large databases is becoming crucial for many applications in different fields such as content searching in multimedia objects, text retrieval or computational biology. These databases are usually indexed off-line to enable an acceleration of on-line searches. Furthermore, the available parallelism has been exploited using clusters to improve query throughput. Recently some authors have proposed the use of Graphic Processing Units (GPUs) to accelerate bruteforce searching algorithms for metric-space databases. In this work we improve existing GPU brute-force implementations and explore the viability of GPUs to accelerate indexing techniques. This exploration includes an interesting discussion about the performance of both bruteforce and indexing-based algorithms that takes into account the intrinsic dimensionality of the element of the database.