Sciweavers

188 search results - page 16 / 38
» Estimation error bounds for denoising by sparse approximatio...
Sort
View
CORR
2007
Springer
135views Education» more  CORR 2007»
14 years 11 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
ALGORITHMICA
1998
94views more  ALGORITHMICA 1998»
14 years 11 months ago
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
Philip N. Klein, Sairam Subramanian
89
Voted
TSP
2010
14 years 6 months ago
Compressed sensing performance bounds under Poisson noise
Abstract--This paper describes performance bounds for compressed sensing (CS) where the underlying sparse or compressible (sparsely approximable) signal is a vector of nonnegative ...
Maxim Raginsky, Rebecca Willett, Zachary T. Harman...
TIT
1998
96views more  TIT 1998»
14 years 11 months ago
Nonparametric Estimation of Transfer Functions: Rates of Convergence and Adaptation
Abstract— The paper deals with estimating transfer functions of stable linear time-invariant systems under stochastic assumptions. We adopt a nonparametric minimax approach for m...
Alexander Goldenshluger
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 12 months ago
Estimation with Random Linear Mixing, Belief Propagation and Compressed Sensing
Abstract--We apply Guo and Wang's relaxed belief propagation (BP) method to the estimation of a random vector from linear measurements followed by a componentwise probabilisti...
Sundeep Rangan