Results 31 to 40 of about 2,261,092 (281)
Reduction of generalized complex structures
We study reduction of generalized complex structures. More precisely, we investigate the following question. Let $J$ be a generalized complex structure on a manifold $M$, which admits an action of a Lie group $G$ preserving $J$. Assume that $M_0$ is a $G$-invariant smooth submanifold and the $G$-action on $M_0$ is proper and free so that $M_G:=M_0/G ...
Stiénon, Mathieu, Xu, Ping
openaire +2 more sources
Generic techniques to improve SVC enhancement layer encoding: digest of technical papers [PDF]
Scalable video coding is an important mechanism to provide different types of end-user devices with different versions of the same encoded bitstream. However, scalable video encoding remains a computationally expensive operation.
Cuenca, Pedro +6 more
core +1 more source
Noise Reduction in Complex Biological Switches [PDF]
AbstractCells operate in noisy molecular environments via complex regulatory networks. It is possible to understand how molecular counts are related to noise in specific networks, but it is not generally clear how noise relates to network complexity, because different levels of complexity also imply different overall number of molecules.
Cardelli L +4 more
openaire +5 more sources
On the combinatorics of sparsification [PDF]
Background: We study the sparsification of dynamic programming folding algorithms of RNA structures. Sparsification applies to the mfe-folding of RNA structures and can lead to a significant reduction of time complexity.
Christian M Reidys +2 more
core +7 more sources
Reduction of complex HamiltonianG-spaces
Let \((X,\omega)\) be a Kähler space, in the sense that \(X\) is a complex space with an open cover \((U_ \alpha)\) and \(\omega\) is a family of continuous strictly plurisubharmonic functions \(\varphi_ \alpha : U_ \alpha \to \mathbb{R}\) such that there are \(f_{\alpha \beta} \in {\mathcal O}(U_ \alpha\cap U_ \beta)\) whose real parts equal ...
Heinzner, P., Loose, F.
openaire +1 more source
Complexity reduction of astrochemical networks
We present a new computational scheme aimed at reducing the complexity of the chemical networks in astrophysical models, one which is shown to markedly improve their computational efficiency.
E. Merlin +19 more
core +1 more source
Real-time complexity constrained encoding [PDF]
Complex software appliances can be deployed on hardware with limited available computational resources. This computational boundary puts an additional constraint on software applications.
Lambert, Peter +4 more
core +1 more source
An Efficient Early Iteration Termination for Turbo Decoder
Turbo code finds wide applications in mobile communication, deep space communication, satellite communication and short-range communication despite its high computational complexity and iterative nature.
P. Salija
doaj +1 more source
Chemical complexity in astrophysical simulations: optimization and reduction techniques
Chemistry has a key role in the evolution of the interstellar medium (ISM), so it is highly desirable to follow its evolution in numerical simulations. However, it may easily dominate the computational cost when applied to large systems. In this paper we
Bovino, S. +3 more
core +1 more source
Model reduction for complex hyperbolic networks [PDF]
We recently introduced the joint gramian for combined state and parameter reduction [C. Himpe and M. Ohlberger. Cross-Gramian Based Combined State and Parameter Reduction for Large-Scale Control Systems. arXiv:1302.0634, 2013], which is applied in this work to reduce a parametrized linear time-varying control system modeling a hyperbolic network.
Himpe, Christian, Ohlberger, Mario
openaire +2 more sources

