Results 1  10
of
660
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
 California Institute of Technology, Pasadena
, 2008
"... Abstract. Compressive sampling offers a new paradigm for acquiring signals that are compressible with respect to an orthonormal basis. The major algorithmic challenge in compressive sampling is to approximate a compressible signal from noisy samples. This paper describes a new iterative recovery alg ..."
Abstract

Cited by 770 (13 self)
 Add to MetaCart
Abstract. Compressive sampling offers a new paradigm for acquiring signals that are compressible with respect to an orthonormal basis. The major algorithmic challenge in compressive sampling is to approximate a compressible signal from noisy samples. This paper describes a new iterative recovery
SPIKE DETECTION FROM INACCURATE SAMPLINGS
"... Abstract. This article investigates the superresolution phenomenon using the celebrated statistical estimator LASSO in the complex valued measure framework. More precisely, we study the recovery of a discrete measure (spike train) from few noisy observations (Fourier samples, moments, Stieltjes tra ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. This article investigates the superresolution phenomenon using the celebrated statistical estimator LASSO in the complex valued measure framework. More precisely, we study the recovery of a discrete measure (spike train) from few noisy observations (Fourier samples, moments, Stieltjes
Stable signal recovery from incomplete and inaccurate measurements,”
 Comm. Pure Appl. Math.,
, 2006
"... Abstract Suppose we wish to recover a vector x 0 ∈ R m (e.g., a digital signal or image) from incomplete and contaminated observations y = Ax 0 + e; A is an n × m matrix with far fewer rows than columns (n m) and e is an error term. Is it possible to recover x 0 accurately based on the data y? To r ..."
Abstract

Cited by 1397 (38 self)
 Add to MetaCart
, suppose that A is a Gaussian random matrix; then stable recovery occurs for almost all such A's provided that the number of nonzeros of x 0 is of about the same order as the number of observations. As a second instance, suppose one observes few Fourier samples of x 0 ; then stable recovery occurs
Compressive sampling
, 2006
"... Conventional wisdom and common practice in acquisition and reconstruction of images from frequency data follow the basic principle of the Nyquist density sampling theory. This principle states that to reconstruct an image, the number of Fourier samples we need to acquire must match the desired res ..."
Abstract

Cited by 1441 (15 self)
 Add to MetaCart
resolution of the image, i.e. the number of pixels in the image. This paper surveys an emerging theory which goes by the name of “compressive sampling” or “compressed sensing,” and which says that this conventional wisdom is inaccurate. Perhaps surprisingly, it is possible to reconstruct images or signals
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
. For each experimental run, we first gen erated random CPTs. We then sampled from the joint distribution defined by the network and clamped the observed nodes (all nodes in the bottom layer) to their sampled value. Given a structure and observations, we then ran three inference algorithms junction tree
New Directions in Traffic Measurement and Accounting
, 2001
"... Accurate network traffic measurement is required for accounting, bandwidth provisioning, and detecting DOS attacks. However, keeping a counter to measure the traffic sent by each of a million concurrent flows is too expensive (using SRAM) or slow (using DRAM). The current stateoftheart (e.g., Cis ..."
Abstract

Cited by 353 (11 self)
 Add to MetaCart
.g., Cisco NetFlow) methods which count periodically sampled packets are slow, inaccurate, and memoryintensive. Our paper introduces a paradigm shift by concentrating on the problem of measuring only "heavy" flows  i.e., flows whose traffic is above some threshold such as 1% of the link. After
SMARTS: Accelerating Microarchitecture Simulation via Rigorous Statistical Sampling
 in Proceedings of the 30th annual international symposium on Computer architecture
, 2003
"... Current softwarebased microarchitecture simulators are many orders of magnitude slower than the hardware they simulate. Hence, most microarchitecture design studies draw their conclusions from drastically truncated benchmark simulations that are often inaccurate and misleading. This paper presents ..."
Abstract

Cited by 258 (25 self)
 Add to MetaCart
Current softwarebased microarchitecture simulators are many orders of magnitude slower than the hardware they simulate. Hence, most microarchitecture design studies draw their conclusions from drastically truncated benchmark simulations that are often inaccurate and misleading. This paper presents
Accurate shortterm analysis of the fundamental frequency and the harmonicstonoise ratio of a sampled sound
 IFA Proceedings 17
, 1993
"... We present a straightforward and robust algorithm for periodicity detection, working in the lag (autocorrelation) domain. When it is tested for periodic signals and for signals with additive noise or jitter, it proves to be several orders of magnitude more accurate than the methods commonly used for ..."
Abstract

Cited by 260 (4 self)
 Add to MetaCart
the position of the maximum of the autocorrelation function of the sound, while the degree of periodicity (the harmonicstonoise ratio) of the sound can be found from the relative height of this maximum. However, sampling and windowing cause problems in accurately determining the position and height
QoS Routing in Networks with Inaccurate Information: Theory and Algorithms
 IEEE/ACM Transactions on Networking
, 1997
"... This paper investigates the problem of routing flows with QualityofService (QoS) requirements through one or more networks, when the information available for making such routing decisions is inaccurate. Inaccuracy in the information used in computing QoS routes, e.g., network state such as link a ..."
Abstract

Cited by 97 (0 self)
 Add to MetaCart
This paper investigates the problem of routing flows with QualityofService (QoS) requirements through one or more networks, when the information available for making such routing decisions is inaccurate. Inaccuracy in the information used in computing QoS routes, e.g., network state such as link
How (In)accurate are demand forecasts in public works projects?”
 Journal of the American
, 2005
"... Abstract This article presents results from the first statistically significant study of traffic forecasts in transportation infrastructure projects. The sample used is the largest of its kind, covering 210 projects in 14 nations worth US$59 billion. The study shows with very high statistical signi ..."
Abstract

Cited by 76 (6 self)
 Add to MetaCart
Abstract This article presents results from the first statistically significant study of traffic forecasts in transportation infrastructure projects. The sample used is the largest of its kind, covering 210 projects in 14 nations worth US$59 billion. The study shows with very high statistical
Results 1  10
of
660