Sciweavers

1369 search results - page 188 / 274
» A Practical Implementation of the Timing Attack
Sort
View
ICML
2009
IEEE
15 years 12 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
POPL
2002
ACM
15 years 11 months ago
Composing dataflow analyses and transformations
Dataflow analyses can have mutually beneficial interactions. Previous efforts to exploit these interactions have either (1) iteratively performed each individual analysis until no...
Sorin Lerner, David Grove, Craig Chambers
FPGA
2010
ACM
276views FPGA» more  FPGA 2010»
15 years 8 months ago
Accelerating Monte Carlo based SSTA using FPGA
Monte Carlo based SSTA serves as the golden standard against alternative SSTA algorithms, but it is seldom used in practice due to its high computation time. In this paper, we acc...
Jason Cong, Karthik Gururaj, Wei Jiang, Bin Liu, K...
66
Voted
CCGRID
2009
IEEE
15 years 5 months ago
Developing Scheduling Policies in gLite Middleware
We describe our experiences from implementing and integrating a new job scheduling algorithm in the gLite Grid middleware and present experimental results that compare it to the e...
A. Kretsis, Panagiotis C. Kokkinos, Emmanouel A. V...
IWCMC
2009
ACM
15 years 5 months ago
WMNSec: security for wireless mesh networks
Wireless Mesh Networks (WMNs) are gaining popularity as a flexible and inexpensive replacement for Ethernet-based infrastructure. However, WMN security has not been covered adequ...
Georg Lukas, Christian Fackroth