1424 search results - page 240 / 285 » Improving on Version Stamps |
182
click to vote
PPOPP
2003
ACM
15 years 11 months ago
2003
ACM
Sensor networks are long-running computer systems with many sensing/compute nodes working to gather information about their environment, process and fuse that information, and in ...
156
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
180
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
167
click to vote
PLDI
2000
ACM
15 years 10 months ago
2000
ACM
We describe the design and implementation of Dynamo, a software dynamic optimization system that is capable of transparently improving the performance of a native instruction stre...
159
click to vote
JAVA
1999
Springer
15 years 10 months ago
1999
Springer
CT With the development of dynamic compilers for Java, Java’s performance promises to rival that of equivalent C/C++ binary executions. This should ensure that Java will become t...