Results 1 - 10
of
108
Chapter 1 Stabilization and Control over Gaussian Networks
"... Abstract We provide an overview and some recent results on real-time communication and control over Gaussian channels. In particular, the problem of remote stabilization of linear systems driven by Gaussian noise over Gaussian relay channels is considered. Necessary and sufficient conditions for mea ..."
Abstract
- Add to MetaCart
Abstract We provide an overview and some recent results on real-time communication and control over Gaussian channels. In particular, the problem of remote stabilization of linear systems driven by Gaussian noise over Gaussian relay channels is considered. Necessary and sufficient conditions
Infinite-dimensional quadrature and approximation of distributions, Found
- Comput. Math. 9
, 2009
"... Abstract. We study numerical integration of Lipschitz functionals on a Banach space by means of deterministic and randomized (Monte Carlo) algorithms. This quadrature problem is shown to be closely related to the problem of quantization and to the average Kolmogorov widths of the underlying probabil ..."
Abstract
-
Cited by 23 (7 self)
- Add to MetaCart
probability measure. In addition to the general setting we analyze in particular integration w.r.t. Gaussian measures and distributions of diffusion processes. We derive lower bounds for the worst case error of every algorithm in terms of its cost, and we present matching upper bounds, up to logarithms
Delay Constrained Linear Transmission of Random State Measurements
"... Abstract—Linear transmission of state measurements is stud-ied, where the control center (CC) sends random state mea-surement requests to multiple sensors. Each sensor is capable of measuring multiple system parameters, and the CC asks for a particular system parameter from each sensor at each time ..."
Abstract
- Add to MetaCart
algorithm and optimal linear transmission (LT) scheme are presented. It is shown that, as opposed to the case of a single parameter measurement, the performance of the proposed LT strategy improves as the delay constraint is relaxed, and achieves the Shannon lower bound under certain matching conditions
1 Near-Oracle Performance of Greedy Block-Sparse Estimation Techniques from Noisy Measurements
"... ar ..."
1 Partially Linear Estimation with Application to Sparse Signal Recovery From Measurement Pairs
"... ar ..."
scattered light intensity
"... Deciphering the three-dimensional (3D) structure of complex molecules is of major importance, typically accomplished with X-ray crystallography. Unfortunately, many important molecules cannot be crystallized, hence their 3D structure is unknown. Ankylography presents an alternative, relying on scatt ..."
Abstract
- Add to MetaCart
on scattering an ultrashort X-ray pulse off a single molecule before it disintegrates, measuring the far-field intensity on a two-dimensional surface, followed by computation. However, significant information is absent due to lower dimensionality of the measurements and the inability to measure the phase
RICE UNIVERSITY Regime Change: Sampling Rate vs. Bit-Depth in Compressive Sensing
, 2011
"... The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order of t ..."
Abstract
- Add to MetaCart
. We develop a new theoretical framework to analyze this extreme case and develop new algorithms for signal reconstruction from such coarsely quantized measurements. The 1-bit CS framework leads us to scenarios where it may be more appropriate to reduce bit-depth instead of sampling rate. We find
ABSTRACT Contributions to Information-based Complexity, Image Understanding, and Logic Circuit Design
"... This work consists of three parts. The first two describe new results In information-based complexity and applications of the general theory to the field of computer vision. The last presents an average case result of a. different sort: the design of a binary comparator. Part I is joint work with G. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
. W. Wasilkowski. In this part, we study approximation of linear functionals on a separable Banach space equipped with a Gaussian measure. We study optimal information and optimal algorithms in average case, probabilistic and asymptotic settings, for a. general error functional. We prove that adaptive
Sequential Detection for a Target in
"... Abstract—Sequential detection allows analyzing an incoming data flow, and detect the distribution change of these mea-surements. In this paper, we develop the sequential detection algorithm for a target under compound-Gaussian clutter. Both the target and clutter parameters are assumed unknown. We f ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract—Sequential detection allows analyzing an incoming data flow, and detect the distribution change of these mea-surements. In this paper, we develop the sequential detection algorithm for a target under compound-Gaussian clutter. Both the target and clutter parameters are assumed unknown. We
Yahoo! Labs
, 2008
"... Editor: In this paper we consider the problem of Gaussian process classifier (GPC) model selection with different Leave-One-Out (LOO) Cross Validation (CV) based optimization criteria and provide a practical algorithm using LOO predictive distributions with such criteria to select hyperparameters. A ..."
Abstract
- Add to MetaCart
Editor: In this paper we consider the problem of Gaussian process classifier (GPC) model selection with different Leave-One-Out (LOO) Cross Validation (CV) based optimization criteria and provide a practical algorithm using LOO predictive distributions with such criteria to select hyperparameters
Results 1 - 10
of
108