Results 1  10
of
5,933
The unity and diversity of executive functions and their contributions to complex “Frontal Lobe” tasks: a latent variable analysis
 COGNIT PSYCHOL
, 2000
"... This individual differences study examined the separability of three often postulated executive functions—mental set shifting ("Shifting"), information updating and monitoring ("Updating"), and inhibition of prepotent responses ("Inhibition")—and their roles in complex ..."
Abstract

Cited by 696 (9 self)
 Add to MetaCart
This individual differences study examined the separability of three often postulated executive functions—mental set shifting ("Shifting"), information updating and monitoring ("Updating"), and inhibition of prepotent responses ("Inhibition")—and their roles in complex
A gentle tutorial on the EM algorithm and its application to parameter estimation for gaussian mixture and hidden markov models
, 1997
"... We describe the maximumlikelihood parameter estimation problem and how the Expectationform of the EM algorithm as it is often given in the literature. We then develop the EM parameter estimation procedure for two applications: 1) finding the parameters of a mixture of Gaussian densities, and 2) fi ..."
Abstract

Cited by 693 (4 self)
 Add to MetaCart
) finding the parameters of a hidden Markov model (HMM) (i.e., the BaumWelch algorithm) for both discrete and Gaussian mixture observation models. We derive the update equations in fairly explicit detail but we do not prove any convergence properties. We try to emphasize intuition rather than mathematical
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
modification to the update rules in that we normalized both ..\ and 1r messages at each iteration. As Pearl Nodes were updated in parallel: at each iteration all nodes calculated their outgoing messages based on the incoming messages of their neighbors from the pre vious iteration. The messages were said
Fusion, Propagation, and Structuring in Belief Networks
 ARTIFICIAL INTELLIGENCE
, 1986
"... Belief networks are directed acyclic graphs in which the nodes represent propositions (or variables), the arcs signify direct dependencies between the linked propositions, and the strengths of these dependencies are quantified by conditional probabilities. A network of this sort can be used to repre ..."
Abstract

Cited by 484 (8 self)
 Add to MetaCart
to represent the generic knowledge of a domain expert, and it turns into a computational architecture if the links are used not merely for storing factual knowledge but also for directing and activating the data flow in the computations which manipulate this knowledge. The first part of the paper deals
Practical animation of liquids
 Graphical Models and Image Processing
, 1996
"... We present a comprehensive methodology for realistically animating liquid phenomena. Our approach unifies existing computer graphics techniques for simulating fluids and extends them by incorporating more complex behavior. It is based on the NavierStokes equations which couple momentum and mass con ..."
Abstract

Cited by 445 (26 self)
 Add to MetaCart
We present a comprehensive methodology for realistically animating liquid phenomena. Our approach unifies existing computer graphics techniques for simulating fluids and extends them by incorporating more complex behavior. It is based on the NavierStokes equations which couple momentum and mass
A generic process algebra
 Proc. of the Workshop Essays on Algebraic Process Calculi (APC 25), volume 162 of Electr. Notes Theor. Comput. Sci
, 2006
"... Process algebra is the study of distributed or parallel systems by algebraic means. Originating in computer science, process algebra has been extended in recent years to encompass not just discreteevent systems, but also continuously evolving phenomena, resulting in socalled hybrid process algebra ..."
Abstract

Cited by 253 (22 self)
 Add to MetaCart
of χ are discussed, and it is explained how equational reasoning simplifies tool implementations for simulation and verification. A bottle filling line example is introduced to illustrate system analysis by means of equational reasoning.
Ensemble Data Assimilation without Perturbed Observations
 MON. WEA. REV
, 2002
"... The ensemble Kalman filter (EnKF) is a data assimilation scheme based on the traditional Kalman filter update equation. An ensemble of forecasts are used to estimate the backgrounderror covariances needed to compute the Kalman gain. It is known that if the same observations and the same gain are ..."
Abstract

Cited by 287 (21 self)
 Add to MetaCart
The ensemble Kalman filter (EnKF) is a data assimilation scheme based on the traditional Kalman filter update equation. An ensemble of forecasts are used to estimate the backgrounderror covariances needed to compute the Kalman gain. It is known that if the same observations and the same gain
The Template Update Problem
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2003
"... Template tracking is a well studied problem in computer vision which dates back to the LucasKanade algorithm of 1981. Since then the paradigm has been extended in a variety of ways including: arbitrary parametric transformations of the template, and linear appearance variation. These extensions ..."
Abstract

Cited by 201 (1 self)
 Add to MetaCart
have been combined, culminating in nonrigid appearance models such as Active Appearance Models (AAMs) and Active Blobs. One question that has received very little attention is how to update the template over time so that it remains a good model of the object being tracked. This paper proposes
A PDEBased Fast Local Level Set Method
 Journal of Computational Physics
, 1999
"... this paper we localize the level set method. Our localization works in as much generality as does the original method and all of its recent variants [27, 28], but requires an order of magnitude less computing effort. Earlier work on localization was done by Adalsteinsson and Sethian [1]. Our approac ..."
Abstract

Cited by 266 (26 self)
 Add to MetaCart
(PDE) based, in the sense that our localization, extension, and reinitialization are all based on solving different PDEs. This leads to a simple, accurate, and flexible method. Equations (10) and (11) of Section 2 enable us to update the level set function (or functions in the multiphase case) without
Combinators for bidirectional tree transformations: A linguistic approach to the view update problem
 In ACM SIGPLAN–SIGACT Symposium on Principles of Programming Languages (POPL
, 2005
"... We propose a novel approach to the view update problem for treestructured data: a domainspecific programming language in which all expressions denote bidirectional transformations on trees. In one direction, these transformations—dubbed lenses—map a “concrete ” tree into a simplified “abstract vie ..."
Abstract

Cited by 205 (17 self)
 Add to MetaCart
We propose a novel approach to the view update problem for treestructured data: a domainspecific programming language in which all expressions denote bidirectional transformations on trees. In one direction, these transformations—dubbed lenses—map a “concrete ” tree into a simplified “abstract
Results 1  10
of
5,933