12052 search results - page 2324 / 2411 » compute 2010 |
148
click to vote
CF
2010
ACM
15 years 11 months ago
2010
ACM
Branches that depend directly or indirectly on load instructions are a leading cause of mispredictions by state-of-the-art branch predictors. For a branch of this type, there is a...
170
click to vote
CF
2010
ACM
15 years 11 months ago
2010
ACM
Per-core local (scratchpad) memories allow direct inter-core communication, with latency and energy advantages over coherent cache-based communication, especially as CMP architect...
180
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
171
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
206
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...