Sciweavers

4277 search results - page 12 / 856
» On Multiple Linear Approximations
Sort
View
DC
2010
13 years 7 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
EOR
2011
134views more  EOR 2011»
13 years 2 months ago
Linear programming based decomposition methods for inventory distribution systems
We consider an inventory distribution system consisting of one warehouse and multiple retailers. The retailers face random demand and are supplied by the warehouse. The warehouse ...
Sumit Kunnumkal, Huseyin Topaloglu
ICML
2008
IEEE
14 years 8 months ago
An analysis of linear models, linear value-function approximation, and feature selection for reinforcement learning
We show that linear value-function approximation is equivalent to a form of linear model approximation. We then derive a relationship between the model-approximation error and the...
Ronald Parr, Lihong Li, Gavin Taylor, Christopher ...
IMA
2009
Springer
113views Cryptology» more  IMA 2009»
14 years 1 months ago
On Linear Cryptanalysis with Many Linear Approximations
Abstract. In this paper we present a theoretical framework to quantify the information brought by several linear approximations of a blockcipher without putting any restriction on ...
Benoît Gérard, Jean-Pierre Tillich
ICML
2010
IEEE
13 years 8 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio