10146 search results - page 96 / 2030 » Fast FAST |
205
click to vote
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
138
click to vote
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
117
click to vote
DCC
2004
IEEE
16 years 1 months ago
2004
IEEE
3D neuro-anatomical images and other volumetric data sets are important in many scientific and biomedical fields. Since such sets may be extremely large, a scalable compression me...
115
click to vote
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
140
click to vote
ICCD
2006
IEEE
15 years 11 months ago
2006
IEEE
— L1 data caches in high-performance processors continue to grow in set associativity. Higher associativity can significantly increase the cache energy consumption. Cache access...