Sciweavers

12519 search results - page 2299 / 2504
» Approximation Problems Categories
Sort
View
SOSP
2009
ACM
16 years 1 months ago
Improving application security with data flow assertions
RESIN is a new language runtime that helps prevent security vulnerabilities, by allowing programmers to specify application-level data flow assertions. RESIN provides policy obje...
Alexander Yip, Xi Wang, Nickolai Zeldovich, M. Fra...
PEPM
2009
ACM
16 years 1 months ago
Bidirectional data-flow analyses, type-systematically
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
Maria João Frade, Ando Saabas, Tarmo Uustal...
PEPM
2009
ACM
16 years 1 months ago
Self-adjusting computation: (an overview)
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...
Umut A. Acar
FPGA
2010
ACM
209views FPGA» more  FPGA 2010»
16 years 1 months ago
FPGA power reduction by guarded evaluation
Guarded evaluation is a power reduction technique that involves identifying sub-circuits (within a larger circuit) whose inputs can be held constant (guarded) at specific times d...
Chirag Ravishankar, Jason Helge Anderson
FPGA
2010
ACM
359views FPGA» more  FPGA 2010»
16 years 1 months ago
Towards scalable placement for FPGAs
Placement based on simulated annealing is in dominant use in the FPGA community due to its superior quality of result (QoR). However, given the progression of FPGA device capacity...
Huimin Bian, Andrew C. Ling, Alexander Choong, Jia...
« Prev « First page 2299 / 2504 Last » Next »