Sciweavers

219 search results - page 4 / 44
» Solving Semi-infinite Linear Programs Using Boosting-Like Me...
Sort
View
ACNS
2011
Springer
231views Cryptology» more  ACNS 2011»
12 years 9 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
VMCAI
2007
Springer
13 years 12 months ago
Constraint Solving for Interpolation
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
Andrey Rybalchenko, Viorica Sofronie-Stokkermans
EMNLP
2010
13 years 3 months ago
On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
Alexander M. Rush, David Sontag, Michael Collins, ...
ANOR
2006
59views more  ANOR 2006»
13 years 5 months ago
The empirical behavior of sampling methods for stochastic programming
Abstract. We investigate the quality of solutions obtained from sample-average approximations to two-stage stochastic linear programs with recourse. We use a recently developed sof...
Jeff Linderoth, Alexander Shapiro, Stephen Wright
JCP
2008
178views more  JCP 2008»
13 years 5 months ago
Building Design Optimization Using Sequential Linear Programming
-In this paper a nonlinear programming approach is used for the minimization of total communication cost to determine the optimum room dimensions for each room. The nonlinear progr...
Rekha Bhowmik