• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,057,079
Next 10 →

discrete observations

by Miljenko Huzak
"... Parameter estimation of diffusion models from ..."
Abstract - Add to MetaCart
Parameter estimation of diffusion models from

discretely observed stochastic processes

by Hiroki Masuda, Hiroki Masuda , 2013
"... Asymptotics for functionals of self-normalized residuals of discretely observed stochastic processes ..."
Abstract - Add to MetaCart
Asymptotics for functionals of self-normalized residuals of discretely observed stochastic processes

Measurements of Nondegenerate Discrete Observables

by Masanao Ozawa , 2000
"... Every measurement on a quantum system causes a state change from the system state just before the measurement to the system state just after the measurement conditional upon the outcome of measurement. This paper determines all the possible conditional state changes caused by measurements of nondege ..."
Abstract - Add to MetaCart
of nondegenerate discrete observables. For this purpose, the following conditions are shown to be equivalent for measurements of nondegenerate discrete observables: (i) The joint probability distribution of the outcomes of successive measurements depends affinely on the initial state. (ii) The apparatus has

Detectability of Discrete Event Systems

by Shaolong Shu, Feng Lin, Hao Ying
"... In this paper, we investigate the detectability problem in discrete event systems. We assume that we do not know initially which state the system is in. The problem is to determine the current and subsequent states of the system based on a sequence of observation. The observation includes partial ev ..."
Abstract - Cited by 789 (14 self) - Add to MetaCart
In this paper, we investigate the detectability problem in discrete event systems. We assume that we do not know initially which state the system is in. The problem is to determine the current and subsequent states of the system based on a sequence of observation. The observation includes partial

Estimating Functions for Discretely Observed Diffusions: A Review

by Michael Sørensen - EDS, `SELECTED PROCEEDINGS OF THE SYMPOSIUM ON ESTIMATING FUNCTIONS , 1997
"... Several estimating functions for discretely observed diffusion processes are reviewed. First we discuss simple explicit estimating functions based on Gaussian approximations to the transition density. The corresponding estimators often have considerable bias, a problem that can be avoided by usi ..."
Abstract - Cited by 142 (14 self) - Add to MetaCart
Several estimating functions for discretely observed diffusion processes are reviewed. First we discuss simple explicit estimating functions based on Gaussian approximations to the transition density. The corresponding estimators often have considerable bias, a problem that can be avoided

Ant algorithms for discrete optimization

by Marco Dorigo, Gianni Di Caro, Luca M. Gambardella - ARTIFICIAL LIFE , 1999
"... This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies’ foraging behavior, and introduces the ant colony optimization (ACO) metaheuristic. In the first part of the article the basic ..."
Abstract - Cited by 475 (42 self) - Add to MetaCart
This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies’ foraging behavior, and introduces the ant colony optimization (ACO) metaheuristic. In the first part of the article the basic

Approximating discrete probability distributions with dependence trees

by C. K. Chow, C. N. Liu - IEEE TRANSACTIONS ON INFORMATION THEORY , 1968
"... A method is presented to approximate optimally an n-dimensional discrete probability distribution by a product of second-order distributions, or the distribution of the first-order tree dependence. The problem is to find an optimum set of n-1 first order dependence relationship among the n variables ..."
Abstract - Cited by 874 (0 self) - Add to MetaCart
A method is presented to approximate optimally an n-dimensional discrete probability distribution by a product of second-order distributions, or the distribution of the first-order tree dependence. The problem is to find an optimum set of n-1 first order dependence relationship among the n

On the Use of Windows for Harmonic Analysis With the Discrete Fourier Transform

by Fredric J. Harris - Proc. IEEE , 1978
"... Ahmw-This Pw!r mak = available a concise review of data win- compromise consists of applying windows to the sampled daws pad the ^ affect On the Of in the data set, or equivalently, smoothing the spectral samples. '7 of aoise9 m the ptesence of sdroag bar- The two operations to which we subject ..."
Abstract - Cited by 645 (0 self) - Add to MetaCart
, windowing is less related to sampled windows for DFT's. HERE IS MUCH signal processing devoted to detection and estimation. Detection is the task of determiningif a specific signal set is present in an observation, while estimation is the task of obtaining the values of the parameters

Rules, discretion, and reputation in a model of monetary policy

by Robert J. Barro, David B. Gordon - JOURNAL OF MONETARY ECONOMICS , 1983
"... In a discretionary regime the monetary authority can print more money and create more inflation than people expect. But, although these inflation surprises can have some benefits, they cannot arise systematically in equilibrium when people understand the policymakor's incentives and form their ..."
Abstract - Cited by 794 (9 self) - Add to MetaCart
the policymaker and the private agents, it is possible that reputational forces can substitute for formal rules. Here, we develop an example of a reputational equilibrium where the outcomes turn out to be weighted averages of those from discretion and those from the ideal rule. In particular, the rates

Algorithms for Quantum Computation: Discrete Logarithms and Factoring

by Peter W. Shor , 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken into consi ..."
Abstract - Cited by 1103 (7 self) - Add to MetaCart
into consideration. Several researchers, starting with David Deutsch, have developed models for quantum mechanical computers and have investigated their computational properties. This paper gives Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number
Next 10 →
Results 1 - 10 of 1,057,079
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University