Sciweavers

65 search results - page 5 / 13
» Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Opti...
Sort
View
WSC
2007
13 years 10 months ago
Path-wise estimators and cross-path regressions: an application to evaluating portfolio strategies
Recently developed dual techniques allow us to evaluate a given sub-optimal dynamic portfolio policy by using the policy to construct an upper bound on the optimal value function....
Martin B. Haugh, Ashish Jain
FOCS
2009
IEEE
14 years 3 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
DAGSTUHL
2008
13 years 9 months ago
Error Bounds for Lanczos Approximations of Rational Functions of Matrices
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...
Andreas Frommer, Valeria Simoncini
TIT
2010
101views Education» more  TIT 2010»
13 years 3 months ago
Wideband fading channel capacity with training and partial feedback
We consider the capacity of a wideband fading channel with partial feedback, subject to an average power constraint. A doubly block Rayleigh fading model is assumed with finite co...
Manish Agarwal, Michael L. Honig
FOCS
1999
IEEE
14 years 21 days ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson