438 search results - page 76 / 88 » The forest hiding problem |
CF
2004
ACM
15 years 5 months ago
2004
ACM
The ever increasing gap between processor and memory speed, sometimes referred to as the Memory Wall problem [42], has a very negative impact on performance. This mismatch will be...
138
click to vote
COMPGEOM
2010
ACM
15 years 4 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 ...
132
click to vote
SPATIALCOGNITION
2000
Springer
15 years 3 months ago
2000
Springer
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
TIT
2008
14 years 11 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
104
click to vote
PODS
2011
ACM
14 years 2 months ago
2011
ACM
Scientific workflow systems increasingly store provenance information about the module executions used to produce a data item, as well as the parameter settings and intermediate...