Sciweavers

261 search results - page 9 / 53
» New Constructions of One- and Two-Stage Pooling Designs
Sort
View
DAC
1995
ACM
13 years 11 months ago
New Performance-Driven FPGA Routing Algorithms
—Motivated by the goal of increasing the performance of FPGA-based designs, we propose new Steiner and arborescence FPGA routing algorithms. Our Steiner tree constructions signiï...
Michael J. Alexander, Gabriel Robins
COMPGEOM
1999
ACM
13 years 11 months ago
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
Erik D. Demaine, Martin L. Demaine, Joseph S. B. M...
IJNSEC
2008
103views more  IJNSEC 2008»
13 years 7 months ago
On Cipher Design Based on Switchable Controlled Operations
This paper concerns the problem of reducing the implementation cost of the switchable data-dependent operations (SDDOs) that are a new cryptographic primitive oriented to the desi...
Nikolay A. Moldovyan
FORTE
2009
13 years 5 months ago
Using First-Order Logic to Reason about Submodule Construction
We consider the following problem: For a system consisting of two components, the behavior of one component is known as well as the desired global behavior. What should be the beha...
Gregor von Bochmann
CCS
2011
ACM
12 years 7 months ago
WAPTEC: whitebox analysis of web applications for parameter tampering exploit construction
Parameter tampering attacks are dangerous to a web application whose server fails to replicate the validation of user-supplied data that is performed by the client. Malicious user...
Prithvi Bisht, Timothy Hinrichs, Nazari Skrupsky, ...