Sciweavers

239 search results - page 6 / 48
» Localized Upper and Lower Bounds for Some Estimation Problem...
Sort
View
CLUSTER
2008
IEEE
15 years 4 months ago
Empirical-based probabilistic upper bounds for urgent computing applications
—Scientific simulation and modeling often aid in making critical decisions in such diverse fields as city planning, severe weather prediction and influenza modeling. In some o...
Nick Trebon, Peter H. Beckman
EOR
2008
79views more  EOR 2008»
14 years 9 months ago
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
Konstantinos Kaparis, Adam N. Letchford
MOC
2002
81views more  MOC 2002»
14 years 9 months ago
Optimal a priori error estimates for the hp-version of the local discontinuous Galerkin method for convection--diffusion problem
We study the convergence properties of the hp-version of the local discontinuous Galerkin finite element method for convection-diffusion problems; we consider a model problem in a ...
Paul Castillo, Bernardo Cockburn, Dominik Schö...
DAGSTUHL
2004
14 years 11 months ago
The communication complexity of the Exact-N Problem revisited
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
William I. Gasarch, James Glenn, Andrey Utis
CORR
2011
Springer
148views Education» more  CORR 2011»
14 years 4 months ago
How well can we estimate a sparse vector?
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
Emmanuel J. Candès, Mark A. Davenport