Sciweavers

190 search results - page 12 / 38
» A Simple Proof Technique for Certain Parametricity Results
Sort
View
ASIACRYPT
2008
Springer
13 years 9 months ago
Towards Robust Computation on Encrypted Data
Encryption schemes that support computation on encrypted data are useful in constructing efficient and intuitively simple cryptographic protocols. However, the approach was previo...
Manoj Prabhakaran, Mike Rosulek
RSA
2006
74views more  RSA 2006»
13 years 7 months ago
Robust locally testable codes and products of codes
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
Eli Ben-Sasson, Madhu Sudan
JAIR
2008
111views more  JAIR 2008»
13 years 7 months ago
New Islands of Tractability of Cost-Optimal Planning
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
Michael Katz, Carmel Domshlak
POPL
2009
ACM
14 years 8 months ago
Bidirectionalization for free! (Pearl)
A bidirectional transformation consists of a function get that takes a source (document or value) to a view and a function put that takes an updated view and the original source b...
Janis Voigtländer
CSDA
2008
120views more  CSDA 2008»
13 years 7 months ago
Tree-structured smooth transition regression models
ABSTRACT. This paper introduces a tree-based model that combines aspects of CART (Classification and Regression Trees) and STR (Smooth Transition Regression). The model is called t...
Joel Corrêa da Rosa, Alvaro Veiga, Marcelo C...