Sciweavers

3250 search results - page 203 / 650
» An Algorithm to Solve a Linear Program
Sort
View
CORR
2008
Springer
109views Education» more  CORR 2008»
15 years 6 months ago
A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding
Given a probability distribution over a set of n words to be transmitted, the Huffman Coding problem is to find a minimal-cost prefix free code for transmitting those words. The b...
Mordecai Golin, Xiaoming Xu, Jiajin Yu
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 9 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
MP
2006
105views more  MP 2006»
15 years 6 months ago
Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach
We consider two-stage pure integer programs with discretely distributed stochastic right-hand sides. We present an equivalent superadditive dual formulation that uses the value fun...
Nan Kong, Andrew J. Schaefer, Brady Hunsaker
WSC
2001
15 years 7 months ago
Chessboard distributions
We review chessboard distributions for modeling partially specified finite-dimensional random vectors. Chessboard distributions can match a given set of marginals, a given covaria...
Soumyadip Ghosh, Shane G. Henderson
POPL
2009
ACM
16 years 7 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...