Results 271 to 280 of about 84,435 (298)
Infinite dimensional moment map geometry and closed Fedosov’s star products
Annals of Global Analysis and Geometry, 2015 We study the Cahen–Gutt moment map on the space of symplectic connections of a symplectic manifold. Given a Kähler manifold (M,ω,J), we define a Calabi-type functional F on the space (Formula presented.) of Kähler metrics in the class Θ:=[ω].
La Fuente-Gravy, Laurent
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the 19th Symposium on Interactive 3D Graphics and Games, 2015
We present moment shadow mapping, a novel technique for fast, filtered hard shadows. Like variance shadow mapping it allows for the application of all kinds of efficient texture filtering and antialiasing to its moment shadow map. However it is designed to provide a substantially higher quality. Moment shadow maps store four moments of the depth within
Christoph Peters 0002, Reinhard Klein
openaire +1 more source
We present moment shadow mapping, a novel technique for fast, filtered hard shadows. Like variance shadow mapping it allows for the application of all kinds of efficient texture filtering and antialiasing to its moment shadow map. However it is designed to provide a substantially higher quality. Moment shadow maps store four moments of the depth within
Christoph Peters 0002, Reinhard Klein
openaire +1 more source
Characterization of moments and autocorrelation in MAPs
ACM SIGMETRICS Performance Evaluation Review, 2007Markovian Arrival Processes (MAPs) [9] are a general class of point processes which admits, hyper-exponential, Erlang, and Markov Modulated Poisson Processes (MMPPs) as special cases. MAPs can be easily integrated within queueing models. This makes MAPs useful for evaluating the impact of non-Poisson workloads in networking and for quantifying the ...
Giuliano Casale +2 more
openaire +1 more source
A Heuristic Approach for Fitting MAPs to Moments and Joint Moments
2009 Sixth International Conference on the Quantitative Evaluation of Systems, 2009Fitting of the parameters of a Phase Type (PH) Distribution or a Markovian Arrival Process (MAP) according to some quantities of measured data streams is still a challenge. This paper presents a new approach which computes in two steps for a set of moments and joint moments for an Acyclic PH distribution that is expanded into a MAP.
Peter Buchholz 0001, Jan Kriege
openaire +1 more source
Maps Preserving Moment Sequences
Journal of Theoretical Probability, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Moment Maps and Jacobian Modules
Annals of Global Analysis and Geometry, 2000Let \((M,\omega)\) be a symplectic manifold with an action of a compact Lie group \(G\) which preserves the symplectic form. When the action is Hamiltonian there is a moment map \(\phi: M\to{\mathfrak g}^*\) where \({\mathfrak g}^*\) is the dual of the Lie algebra \({\mathfrak g}\) of \(G\). In [J. Differ. Geom. 49, No. 1, 183-201 (1998; Zbl 0920.57010)
openaire +1 more source
Memoirs of the American Mathematical Society, 2010
This memoir presents a generalization of the moment maps to the category {Diffeology}. This construction applies to every smooth action of any diffeological group G
openaire +1 more source
This memoir presents a generalization of the moment maps to the category {Diffeology}. This construction applies to every smooth action of any diffeological group G
openaire +1 more source
Proceedings of 1995 IEEE International Symposium on Information Theory, 2002
We report on some progress towards a solution for the assignment problem in coding, i.e. the mapping of information words onto codewords at the encoder, and the computationally more difficult problem of mapping codewords onto information words at the decoder of a binary block code.
openaire +1 more source
We report on some progress towards a solution for the assignment problem in coding, i.e. the mapping of information words onto codewords at the encoder, and the computationally more difficult problem of mapping codewords onto information words at the decoder of a binary block code.
openaire +1 more source