Results 1  10
of
258,717
Laplace deconvolution with noisy observations
 Electronic Journal of Statistics
, 2013
"... In the present paper we consider Laplace deconvolution problem for discrete noisy data observed on an interval whose length Tn may increase with the sample size. Although this problem arises in a variety of applications, to the best of our knowledge, it has been given very little attention by the st ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
In the present paper we consider Laplace deconvolution problem for discrete noisy data observed on an interval whose length Tn may increase with the sample size. Although this problem arises in a variety of applications, to the best of our knowledge, it has been given very little attention
Estimating functions for noisy observations of ergodic diffusions
, 2010
"... In this article, general estimating functions for ergodic diffusions sampled at high frequency with noisy observations are presented. The theory is formulated in term of approximate martingale estimating functions based on local means of the observations, and simple conditions are given for rate ..."
Abstract
 Add to MetaCart
In this article, general estimating functions for ergodic diffusions sampled at high frequency with noisy observations are presented. The theory is formulated in term of approximate martingale estimating functions based on local means of the observations, and simple conditions are given for rate
Efficient estimation of stochastic volatility using noisy observations: A multiscale approach
, 2004
"... With the availability of high frequency financial data, nonparametric estimation of volatility of an asset return process becomes feasible. A major problem is how to estimate the volatility consistently and efficiently, when the observed asset returns contain error or noise, for example, in the form ..."
Abstract

Cited by 157 (13 self)
 Add to MetaCart
With the availability of high frequency financial data, nonparametric estimation of volatility of an asset return process becomes feasible. A major problem is how to estimate the volatility consistently and efficiently, when the observed asset returns contain error or noise, for example
Perfect Simulation of Point Processes Given Noisy Observations
, 2001
"... The paper is concerned with the exact simulation of an unobserved true point process conditional on a noisy observation. We use dominated coupling from the past (CFTP) on an augmented state space to produce perfect samples of the target marked point process. An optimized coupling of the target chain ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The paper is concerned with the exact simulation of an unobserved true point process conditional on a noisy observation. We use dominated coupling from the past (CFTP) on an augmented state space to produce perfect samples of the target marked point process. An optimized coupling of the target
Perfect Simulation of Point Patterns From Noisy Observations
, 2000
"... The paper is concerned with the Bayesian analysis of point processes which are observed with noise. It is shown how to produce exact samples from the posterior distribution of the unobserved true point pattern given a noisy observation. The algorithm is a perfect simulation method which applies d ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The paper is concerned with the Bayesian analysis of point processes which are observed with noise. It is shown how to produce exact samples from the posterior distribution of the unobserved true point pattern given a noisy observation. The algorithm is a perfect simulation method which applies
Asymptotic equivalence for inference on the volatility from noisy observations
 Ann. Statist
"... ar ..."
Tracking Stopping Times Through Noisy Observations
, 2008
"... A novel quickest detection setting is proposed which is a generalization of the wellknown Bayesian changepoint detection model. Suppose {(Xi, Yi)}i≥1 is a sequence of pairs of random variables, and that S is a stopping time with respect to {Xi}i≥1. The problem is to find a stopping time T with resp ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
A novel quickest detection setting is proposed which is a generalization of the wellknown Bayesian changepoint detection model. Suppose {(Xi, Yi)}i≥1 is a sequence of pairs of random variables, and that S is a stopping time with respect to {Xi}i≥1. The problem is to find a stopping time T with respect to {Yi}i≥1 that optimally tracks S, in the sense that T minimizes the expected reaction delay E(T − S) +, while keeping the falsealarm probability P(T < S) below a given threshold α ∈ [0, 1]. This problem formulation applies in several areas, such as in communication, detection, forecasting, and quality control. Our results relate to the situation where the Xi’s and Yi’s take values in finite alphabets and where S is bounded by some positive integer κ. By using elementary methods based on the analysis of the tree structure of stopping times, we exhibit an algorithm that computes the optimal average reaction delays for all α ∈ [0, 1], and constructs the associated optimal stopping times T. Under certain conditions on {(Xi, Yi)}i≥1 and S, the algorithm running time is polynomial in κ.
FROM NOISY OBSERVATIONS: LOCAL METHOD OF MOMENTS AND EFFICIENCY
"... An efficient estimator is constructed for the quadratic covariation or integrated covolatility matrix of a multivariate continuous martingale based on noisy and nonsynchronous observations under highfrequency asymptotics. Our approach relies on an asymptotically equivalent continuoustime observat ..."
Abstract
 Add to MetaCart
An efficient estimator is constructed for the quadratic covariation or integrated covolatility matrix of a multivariate continuous martingale based on noisy and nonsynchronous observations under highfrequency asymptotics. Our approach relies on an asymptotically equivalent continuous
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. Technical Report 2003/235, Cryptology ePrint archive, http://eprint.iacr.org, 2006. Previous version appeared at EUROCRYPT 2004
 34 [DRS07] [DS05] [EHMS00] [FJ01] Yevgeniy Dodis, Leonid Reyzin, and Adam
, 2004
"... We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying mater ..."
Abstract

Cited by 532 (38 self)
 Add to MetaCart
We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying
Results 1  10
of
258,717