Sciweavers

1477 search results - page 84 / 296
» Random Convex Programs
Sort
View
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 9 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
DRM
2007
Springer
15 years 11 months ago
Data structures for limited oblivious execution of programs while preserving locality of reference
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
Avinash V. Varadarajan, Ramarathnam Venkatesan, C....
JCC
2008
99views more  JCC 2008»
15 years 3 months ago
Assessment of programs for ligand binding affinity prediction
: The prediction of the binding free energy between a ligand and a protein is an important component in the virtual screening and lead optimization of ligands for drug discovery. T...
Ryangguk Kim, Jeffrey Skolnick
ISW
2010
Springer
15 years 2 months ago
An Architecture for Enforcing JavaScript Randomization in Web2.0 Applications
Abstract. Instruction Set Randomization (ISR) is a promising technique for preventing code-injection attacks. In this paper we present a complete randomization framework for JavaSc...
Elias Athanasopoulos, Antonis Krithinakis, Evangel...
IFIP
1998
Springer
15 years 9 months ago
One Sided Error Predicates in Geometric Computing
A conservative implementation of a predicate returns true only if the exact predicate is true. That is, we accept a one sided error for the implementation. For geometric predicate...
Lutz Kettner, Emo Welzl