نتایج جستجو برای: akers graphical algorithm

تعداد نتایج: 790770  

2010
Youzuo Lin Rosemary Renaut

Graphical processing units introduce the capability for large scale computation in the desk top environment. For the solution of linear systems of equations, much effort has been devoted to efficient implementation of Krylov subspace-based solvers in high performance computing environments. Here the focus is to improve the computational efficiency of the projected conjugate gradient algorithm. ...

This research describes the unsteady two-dimensional reacting flows around a circular cylinder. The numerical solution combines the random vortex method for incompressible two-dimensional viscous fluid flow with a Simple Line Interface Calculation (SLIC) algorithm for the propagation of flame interface. To simplify the governing equations, two fundamental assumptions namely Low Mach Number and ...

2005
Martin J. Wainwright Michael I. Jordan

Graphical models bring together graph theory and probability theory in a powerful formalism for multivariate statistical modeling. In statistical signal processing— as well as in related fields such as communication theory, control theory and bioinformatics—statistical models have long been formulated in terms of graphs, and algorithms for computing basic statistical quantities such as likeliho...

2001
Michael L. Littman Michael Kearns Satinder P. Singh

We describe a new algorithm for computing a Nash equilibrium in graphical games, a compact representation for multi-agent systems that we introduced in previous work. The algorithm is the first to compute equilibria both efficiently and exactly for a non-trivial class of graphical games.

2007
Andrew Ferguson

We began the lecture with some final words on graphical models. Choosing a graphical model is akin to choosing a probability model for your data or choosing an algorithm. Each model has advantages and disadvantages that may make it more or less suitable for modeling your data. A graphical model is a representation of a probability model, so it also carries that model’s plusses and minuses. Grap...

Journal: :Applied Mathematics and Computation 2007
Xuan Zhao Shengjin Wang Xiaoqing Ding

This paper presents a new dynamic generating graphical model for point-sets matching. The existing algorithms on graphical models proved to be quite robust to noise but are susceptible to the effect of outliers. We discuss the separator’s influences on point-sets matching in inference on graphical models theoretically and find that the separator which consists of outliers will break the message...

2002
Thomas Harte Adrian G. Bors

Watermarking has been used for protecting the copyright information in various data such as audio signals, images and video. Copyright protection of graphical objects and models is important for protecting author rights in animation, multimedia, computer-aided design (CAD), virtual reality, medical imaging, etc. Watermarking techniques in 3D graphical objects are facing new challenges because o...

Journal: :Comput. Graph. Forum 1995
Y. P. Kuzmin

One of the most important operations in many graphical systems is the generation of a line segment. This process consists of two stages: clipping and drawing. These two stages are separated in current graphical applications. In this paper a new approach to line generation is proposed, which unifies these stages. The proposed algorithm is based on Bresenham’s line generation algorithm to include...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید