Sciweavers

2652 search results - page 367 / 531
» Privacy-preserving linear programming
Sort
View
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
14 years 5 months ago
Achieving higher frequencies in large-scale nonlinear model predictive control
We present new insights into how to achieve higher frequencies in large-scale nonlinear predictive control using truncated-like schemes. The basic idea is that, instead of solving ...
Victor M. Zavala, Mihai Anitescu
84
Voted
IFIP
2010
Springer
14 years 5 months ago
A Mixed Level Simulation Environment for Stepwise RTOS Software Refinement
Abstract. In this article, we present a flexible simulation environment for embedded real-time software refinement by a mixed level cosimulation. For this, ne the native speed of a...
Markus Becker, Henning Zabel, Wolfgang Müller...
89
Voted
JGO
2010
100views more  JGO 2010»
14 years 5 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
115
Voted
JMLR
2010
149views more  JMLR 2010»
14 years 5 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
ACNS
2011
Springer
231views Cryptology» more  ACNS 2011»
14 years 1 months ago
Cold Boot Key Recovery by Solving Polynomial Systems with Noise
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
Martin Albrecht, Carlos Cid