11211 search results - page 37 / 2243 » Data Structures |
SODA
1997
ACM
14 years 11 months ago
1997
ACM
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
114
click to vote
SP
2010
IEEE
14 years 7 months ago
2010
IEEE
The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...
100
click to vote
GRAPHICSINTERFACE
2001
14 years 11 months ago
2001
We introduce a new acceleration to the standard splatting volume rendering algorithm. Our method achieves full colour (32-bit), depth-sorted and shaded volume rendering significan...
102
click to vote
SIAMCOMP
2012
13 years 7 days ago
2012
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
KDD
2004
ACM
15 years 10 months ago
2004
ACM