Sciweavers

30 search results - page 2 / 6
» Computation of a Class of COntinued Fraction Constants
Sort
View
CRYPTO
2010
Springer
170views Cryptology» more  CRYPTO 2010»
13 years 1 months ago
Securing Computation against Continuous Leakage
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...
Shafi Goldwasser, Guy N. Rothblum
CDC
2009
IEEE
172views Control Systems» more  CDC 2009»
13 years 10 months ago
A dynamic boundary guarding problem with translating targets
Abstract— We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the...
Stephen L. Smith, Shaunak Dattaprasad Bopardikar, ...
STACS
2009
Springer
13 years 12 months ago
Approximating Acyclicity Parameters of Sparse Hypergraphs
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
ECML
2006
Springer
13 years 8 months ago
Task-Driven Discretization of the Joint Space of Visual Percepts and Continuous Actions
We target the problem of closed-loop learning of control policies that map visual percepts to continuous actions. Our algorithm, called Reinforcement Learning of Joint Classes (RLJ...
Sébastien Jodogne, Justus H. Piater
COLT
1993
Springer
13 years 9 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum