Sciweavers

244 search results - page 5 / 49
» Fast Set Intersection in Memory
Sort
View
CGF
2008
83views more  CGF 2008»
13 years 7 months ago
Shallow Bounding Volume Hierarchies for Fast SIMD Ray Tracing of Incoherent Rays
Photorealistic image synthesis is a computationally demanding task that relies on ray tracing for the evaluation of integrals. Rendering time is dominated by tracing long paths th...
Holger Dammertz, Johannes Hanika, Alexander Keller
SIGMOD
2004
ACM
182views Database» more  SIGMOD 2004»
14 years 7 months ago
Efficient set joins on similarity predicates
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
Sunita Sarawagi, Alok Kirpal
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
13 years 9 months ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel
ITCC
2003
IEEE
14 years 1 months ago
Fast Prefix Code Processing
As large main memory becomes more and more available at reasonable prices, processing speed of large data sets becomes more important than reducing main memory usage of internal d...
Renato Pajarola
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
14 years 8 months ago
Fast vertical mining using diffsets
A number of vertical mining algorithms have been proposed recently for association mining, which have shown to be very effective and usually outperform horizontal approaches. The ...
Mohammed Javeed Zaki, Karam Gouda