Sciweavers

48 search results - page 7 / 10
» Typed Compilation Against Non-manifest Base Classes
Sort
View
EUROCRYPT
2010
Springer
14 years 8 days ago
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tr...
COMPSAC
1997
IEEE
13 years 11 months ago
Building Software Recovery Assertions from a Fault Injection-based Propagation Analysis
We have investigated a fault injection-based technique for undermining the ability of software components to produce undesirable outputs into the state of the system. Undesirable ...
Jeffrey M. Voas
CP
2008
Springer
13 years 9 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang
ICML
2010
IEEE
13 years 8 months ago
Non-Local Contrastive Objectives
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...
David Vickrey, Cliff Chiung-Yu Lin, Daphne Koller
AIPS
2010
13 years 7 months ago
A New Approach to Conformant Planning Using CNF*
In this paper, we develop a heuristic, progression based conformant planner, called CNF, which represents belief states by a special type of CNF formulae, called CNF-states. We de...
Son Thanh To, Tran Cao Son, Enrico Pontelli