Results 11 - 20 of 3,562,291

Evaluating the Accuracy of Sampling-Based Approaches to the Calculation of Posterior Moments

by John Geweke - IN BAYESIAN STATISTICS , 1992
"... Data augmentation and Gibbs sampling are two closely related, sampling-based approaches to the calculation of posterior moments. The fact that each produces a sample whose constituents are neither independent nor identically distributed complicates the assessment of convergence and numerical accurac ..."
Abstract - Cited by 604 (12 self) - Add to MetaCart
accuracy of the approximations to the expected value of functions of interest under the posterior. In this paper methods from spectral analysis are used to evaluate numerical accuracy formally and construct diagnostics for convergence. These methods are illustrated in the normal linear model

A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking

by M. Sanjeev Arulampalam, Simon Maskell, Neil Gordon - IEEE TRANSACTIONS ON SIGNAL PROCESSING , 2002
"... Increasingly, for many application areas, it is becoming important to include elements of nonlinearity and non-Gaussianity in order to model accurately the underlying dynamics of a physical system. Moreover, it is typically crucial to process data on-line as it arrives, both from the point of view o ..."
Abstract - Cited by 2006 (2 self) - Add to MetaCart
of storage costs as well as for rapid adaptation to changing signal characteristics. In this paper, we review both optimal and suboptimal Bayesian algorithms for nonlinear/non-Gaussian tracking problems, with a focus on particle filters. Particle filters are sequential Monte Carlo methods based on point mass

A quantitative description of membrane currents and its application to conduction and excitation in nerve

by A. L. Hodgkin, A. F. Huxley - Journal of Physiology , 1952
"... This article concludes a series of papers concerned with the flow of electric current through the surface membrane of a giant nerve fibre (Hodgkin, Huxley & Katz, 1952; Hodgkin & Huxley, 1952 a-c). Its general object is to discu the results of the preceding papers (Part I), to put them into ..."
Abstract - Cited by 1924 (2 self) - Add to MetaCart
This article concludes a series of papers concerned with the flow of electric current through the surface membrane of a giant nerve fibre (Hodgkin, Huxley & Katz, 1952; Hodgkin & Huxley, 1952 a-c). Its general object is to discu the results of the preceding papers (Part I), to put them

Language-Based Information-Flow Security

by Andrei Sabelfeld , Andrew C. Myers - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS , 2003
"... Current standard security practices do not provide substantial assurance that the end-to-end behavior of a computing system satisfies important security policies such as confidentiality. An end-to-end confidentiality policy might assert that secret input data cannot be inferred by an attacker throug ..."
Abstract - Cited by 827 (57 self) - Add to MetaCart
through the attacker's observations of system output; this policy regulates information flow.

Theoretical improvements in algorithmic efficiency for network flow problems

by Jack Edmonds, Richard M. Karp - , 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum-cost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract - Cited by 560 (0 self) - Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum-cost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps

OpenFlow: Enabling Innovation in Campus Networks

by Nick McKeown , Tom Anderson, Hari Balakrishnan, Guru Parulkar, Larry Peterson, Jennifer Rexford, Scott Shenker, Jonathan Turner , 2008
"... This whitepaper proposes OpenFlow: a way for researchers to run experimental protocols in the networks they use every day. OpenFlow is based on an Ethernet switch, with an internal flow-table, and a standardized interface to add and remove flow entries. Our goal is to encourage networking vendors ..."
Abstract - Cited by 718 (84 self) - Add to MetaCart
This whitepaper proposes OpenFlow: a way for researchers to run experimental protocols in the networks they use every day. OpenFlow is based on an Ethernet switch, with an internal flow-table, and a standardized interface to add and remove flow entries. Our goal is to encourage networking vendors

A new approach to the maximum flow problem

by Andrew V. Goldberg, Robert E. Tarjan - JOURNAL OF THE ACM , 1988
"... All previously known efficient maximum-flow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract - Cited by 672 (33 self) - Add to MetaCart
All previously known efficient maximum-flow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length augmenting paths at once (using the layered network approach of Dinic). An alternative method based

Semantic Similarity in a Taxonomy: An Information-Based Measure and its Application to Problems of Ambiguity in Natural Language

by Philip Resnik , 1999
"... This article presents a measure of semantic similarityinanis-a taxonomy based on the notion of shared information content. Experimental evaluation against a benchmark set of human similarity judgments demonstrates that the measure performs better than the traditional edge-counting approach. The a ..."
Abstract - Cited by 609 (9 self) - Add to MetaCart
This article presents a measure of semantic similarityinanis-a taxonomy based on the notion of shared information content. Experimental evaluation against a benchmark set of human similarity judgments demonstrates that the measure performs better than the traditional edge-counting approach

Divergence measures based on the Shannon entropy

by Jianhua Lin - IEEE Transactions on Information theory , 1991
"... Abstract-A new class of information-theoretic divergence measures based on the Shannon entropy is introduced. Unlike the well-known Kullback divergences, the new measures do not require the condition of absolute continuity to be satisfied by the probability distributions in-volved. More importantly, ..."
Abstract - Cited by 666 (0 self) - Add to MetaCart
Abstract-A new class of information-theoretic divergence measures based on the Shannon entropy is introduced. Unlike the well-known Kullback divergences, the new measures do not require the condition of absolute continuity to be satisfied by the probability distributions in-volved. More importantly

A modular three-dimensional finite-difference ground-water flow model

by Model (michael Mcdonald, Arlen Harbaugh - U.S. Geological Survey Techniques of WaterResources Investigations Book 6, Chapter A1 , 1988
"... The primary objective of this course is to discuss the principals of finite difference methods and their applications in groundwater modeling. The emphasis of the class lectures is on the theoretical aspects of numerical modeling (finite difference method). Steps involved in simulation of groundwate ..."
Abstract - Cited by 508 (5 self) - Add to MetaCart
The primary objective of this course is to discuss the principals of finite difference methods and their applications in groundwater modeling. The emphasis of the class lectures is on the theoretical aspects of numerical modeling (finite difference method). Steps involved in simulation
Results 11 - 20 of 3,562,291