686 search results - page 59 / 138 » On the General Applicability of Instruction-Set Randomizatio... |
134
click to vote
SIGECOM
2010
ACM
15 years 8 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
144
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
We present a static control-flow analysis for JavaScript programs running in a web browser. Our analysis tackles numerous challenges posed by modern web applications including asy...
170
Voted
KDD
2012
ACM
13 years 5 months ago
2012
ACM
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
125
Voted
SIGGRAPH
2009
ACM
15 years 10 months ago
2009
ACM
We present a novel bounding volume hierarchy (BVH) compression and decompression method transparently supporting random access on the compressed BVHs. To support random access on ...
128
Voted
PLDI
2006
ACM
15 years 9 months ago
2006
ACM
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...