(1952)_ Some Modern Challenges in Pattern Formation 1:02:03 Finite sample rates for optimal transport estimation problems 1:03:07 The Connection Between RDEs and PDEs 1:01:05 Branes, Quivers, and BPS Algebras 1 of 4 57:45 Branes, Quivers, and BPS Algebras 2 of 4 1:20:05 Branes, ...
Beck, J.: Randomness in lattice point problems. Discrete Mathematics 229, 29-55 (2001)Randomness in lattice point problems - BeckBeck, J., Randomness in lattice point problems, Discrete Math., 229 (2001), no. 1-3, 29-55.J. Beck, Randomness in lattice point problems, Discrete Math. ...
We study the computational complexity of various inverse problems in discrete tomography. These questions are motivated by demands from the material scienc... RJ Gardner,P Gritzmann,D Prangenberg - 《Discrete Mathematics》 被引量: 260发表: 1999年 加载更多来源...
Discrete Comput Geom 35:73–116 (2006) DOI: 10.1007/s00454-005-1202-2 GeometryDiscrete & Computational © 2005 Springer Science+Business Media, Inc. Computational Approaches to Lattice Packing and Covering Problems∗ Achill Schu¨rmann1 and Frank Vallentin2 1Department of Mathematics, University...
Nested line diagrams are, supported in TOSCANA for instance (Vogt & Wille, 1994). In the last years, multiple theoretical extensions and applications have been introduced into the literature that further improve the applicability of traditional FCA theory to knowledge discovery problems. In this ...
Lenz, M.: Lattice points in polytopes, box splines, and Todd operators. Int. Math. Res. Not. 2015(14), 5289–5310 (2015) Dyn, N., Ron, A.: Local approximation by certain spaces of exponential polynomials, approximation order of exponential box splines, and related interpolation problems....
Lattice Boltzmann Method Applied to the Analysis of Transient Conduction-Radiation Problems in a Cylindrical Medium The lattice Boltzmann method (LBM) is applied to solve the energy equation of a transient conduction-radiation heat transfer problem in a 1-D concentric cy... SC Mishra,MY Kim,R Da...
Many interesting problems of lattice coding, such as... Liu,Ling 被引量: 0发表: 2016年 Studies on the squaring construction Reed-Muller codesBarnes-Wall latticeThe code formulas for the iterated squaring construction for a finite group partition chain, derived by Forney [2], ... K Wahlgren,...
“locking-in” the investment in subsequent periods. The use of non-anticipativity constraints requires high levels of memory thus limiting the model to small-sized problems. This can be avoided by using node-variable trees[12,120], as these do not require non-anticipativity constraints, making...
In this way, we can exploit the efficient properties of codes and lattices, simultaneously to improve the security and efficiency of the proposed scheme. For instance, the security of this scheme is based on the hard problems related to lattices, i.e., closest vector problem and shortest ...