Results 1 - 10 of 14,667

Numerical Solutions of the Euler Equations by Finite Volume Methods Using Runge-Kutta Time-Stepping Schemes

by Antony Jameson, Wolfgang Schmidt, Eli Turkel , 1981
"... A new combination of a finite volume discretization in conjunction with carefully designed dissipative terms of third order, and a Runge Kutta time stepping scheme, is shown to yield an effective method for solving the Euler equations in arbitrary geometric domains. The method has been used to deter ..."
Abstract - Cited by 517 (78 self) - Add to MetaCart
to determine the steady transonic flow past an airfoil using an O mesh. Convergence to a steady state is accelerated by the use of a variable time step determined by the local Courant member, and the introduction of a forcing term proportional to the difference between the local total enthalpy and its free

A View Of The Em Algorithm That Justifies Incremental, Sparse, And Other Variants

by Radford Neal, Geoffrey E. Hinton - Learning in Graphical Models , 1998
"... . The EM algorithm performs maximum likelihood estimation for data in which some variables are unobserved. We present a function that resembles negative free energy and show that the M step maximizes this function with respect to the model parameters and the E step maximizes it with respect to the d ..."
Abstract - Cited by 993 (18 self) - Add to MetaCart
. The EM algorithm performs maximum likelihood estimation for data in which some variables are unobserved. We present a function that resembles negative free energy and show that the M step maximizes this function with respect to the model parameters and the E step maximizes it with respect

A computational approach to edge detection

by John Canny - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1986
"... This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumpti ..."
Abstract - Cited by 4675 (0 self) - Add to MetaCart
. We use the criteria in numerical optimization to derive detectors for several common image features, including step edges. On specializing the analysis to step edges, we find that there is a natural uncertainty principle between detection and localization performance, which are the two main goals

Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

by Steven Minton, Mark D. Johnston, Andrew B. Philips, Philip Laird - ARTIF. INTELL , 1992
"... This paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-orderin ..."
Abstract - Cited by 457 (6 self) - Add to MetaCart
This paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value

Recursive Distributed Representations

by Jordan B. Pollack - Artificial Intelligence , 1990
"... A long-standing difficulty for connectionist modeling has been how to represent variable-sized recursive data structures, such as trees and lists, in fixed-width patterns. This paper presents a connectionist architecture which automatically develops compact distributed representations for such compo ..."
Abstract - Cited by 414 (9 self) - Add to MetaCart
A long-standing difficulty for connectionist modeling has been how to represent variable-sized recursive data structures, such as trees and lists, in fixed-width patterns. This paper presents a connectionist architecture which automatically develops compact distributed representations

Non-Deterministic Exponential Time has Two-Prover Interactive Protocols

by Laszlo Babai, Lance Fortnow, Carsten Lund
"... We determine the exact power of two-prover inter-active proof systems introduced by Ben-Or, Goldwasser, Kilian, and Wigderson (1988). In this system, two all-powerful non-communicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract - Cited by 416 (37 self) - Add to MetaCart
that all languages in PSPACE have single prover interactive proofs (Lund, Fortnow, Karloff, Nisan, and Shamir), this represents a further step demonstrating the unexpectedly immense power of randomization and interaction in efficient provability. Indeed, it follows that multiple provers with coins

history in

by Jennifer S Brach, Jaime E Berlin, Jessie M Vanswearingen, Anne B Newman, Stephanie A Studenski Open Access, Anne B Newman, Stephanie A Studenski , 2005
"... Too much or too little step width variability is associated with a fall ..."
Abstract - Add to MetaCart
Too much or too little step width variability is associated with a fall

Acquiring linear subspaces for face recognition under variable lighting

by Kuang-chih Lee, Jeffrey Ho, David Kriegman - IEEE Transactions on Pattern Analysis and Machine Intelligence , 2005
"... Previous work has demonstrated that the image variation of many objects (human faces in particular) under variable lighting can be effectively modeled by low dimensional linear spaces, even when there are multiple light sources and shadowing. Basis images spanning this space are usually obtained in ..."
Abstract - Cited by 317 (2 self) - Add to MetaCart
Previous work has demonstrated that the image variation of many objects (human faces in particular) under variable lighting can be effectively modeled by low dimensional linear spaces, even when there are multiple light sources and shadowing. Basis images spanning this space are usually obtained

Journal of NeuroEngineering and

by Mark D Grabiner, Karen L Troy, Mark D Grabiner, Karen L Troy , 2005
"... Attention demanding tasks during treadmill walking reduce step width variability in young adults ..."
Abstract - Add to MetaCart
Attention demanding tasks during treadmill walking reduce step width variability in young adults

A new meshless local Petrov-Galerkin (MLPG) approach in computational mechanics

by Satya N. Atluri, Shengping Shen - Comput. Mech , 1998
"... Abstract: A comparison study of the efficiency and ac-curacy of a variety of meshless trial and test functions is presented in this paper, based on the general concept of the meshless local Petrov-Galerkin (MLPG) method. 5 types of trial functions, and 6 types of test functions are explored. Differe ..."
Abstract - Cited by 312 (54 self) - Add to MetaCart
. The MLPG5 method (wherein the local, nodal-based test function, over a local sub-domainΩs (or Ωte) centered at a node, is the Heaviside step function) avoids the need for both a domain integral in the attendant symmetric weak-form as well as a singular integral. Convergence studies in the numerical
Results 1 - 10 of 14,667