244 search results - page 3 / 49 » Fast Set Intersection in Memory |
ANCS
2005
ACM
13 years 11 months ago
2005
ACM
New network applications like intrusion detection systems and packet-level accounting require multi-match packet classification, where all matching filters need to be reported. Te...
ICRA
2010
IEEE
13 years 4 months ago
2010
IEEE
We present an efficient algorithm for solving the ray-shooting problem on high dimensional sets. Our algorithm computes the intersection of the boundary of a compact convex set w...
TVCG
2010
13 years 4 months ago
2010
—Ray-triangle intersection is an important algorithm, not only in the field of realistic rendering (based on ray tracing), but also in physics simulation, collision detection, m...
COMPGEOM
1992
ACM
13 years 10 months ago
1992
ACM
A family of sets has the (p, q) property if among any p members of the family some q have a nonempty intersection. It is shown that for every p q d + 1 there is a c = c(p, q, d)...
DGCI
2006
Springer
13 years 8 months ago
2006
Springer
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. In [1], an algorithm which perform...