244 search results - page 2 / 49 » Fast Set Intersection in Memory |
97
Voted
ISAAC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
104
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
We present an optimal cache-oblivious algorithm for finding all intersections between a set of non-intersecting red segments and a set of non-intersecting blue segments in the plan...
102
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
100
click to vote
BIOINFORMATICS
2011
14 years 3 months ago
2011
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
116
click to vote
VC
2008
14 years 11 months ago
2008
This paper presents a novel and fast image-space collision detection algorithm with the A-buffer, where the GPU computes the potentially colliding sets (PCSs), and the CPU performs...