Sciweavers

1945 search results - page 81 / 389
» Speeding up Serpent
Sort
View
PAMI
2010
164views more  PAMI 2010»
14 years 9 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas
PVLDB
2010
151views more  PVLDB 2010»
14 years 9 months ago
Database Compression on Graphics Processors
Query co-processing on graphics processors (GPUs) has become an effective means to improve the performance of main memory databases. However, this co-processing requires the data ...
Wenbin Fang, Bingsheng He, Qiong Luo
PVLDB
2010
90views more  PVLDB 2010»
14 years 9 months ago
The HV-tree: a Memory Hierarchy Aware Version Index
The huge amount of temporal data generated from many important applications call for a highly efficient and scalable version index. The TSB-tree has the potential of large scalab...
Rui Zhang, Martin Stradling
PVLDB
2010
89views more  PVLDB 2010»
14 years 9 months ago
Transforming Range Queries To Equivalent Box Queries To Optimize Page Access
Range queries based on L1 distance are a common type of queries in multimedia databases containing feature vectors. We propose a novel approach that transforms the feature space i...
Sakti Pramanik, Alok Watve, Chad R. Meiners, Alex ...
SIGOPS
2010
127views more  SIGOPS 2010»
14 years 9 months ago
Optimizing information flow in the gossip objects platform
Gossip-based protocols are commonly used for diffusing information in large-scale distributed applications. GO (Gossip Objects) is a per-node gossip platform that we developed in...
Ymir Vigfusson, Ken Birman, Qi Huang, Deepak P. Na...