JAIST Repository: 省メモリ計算モデル上でのアルゴリズム設計技法の開発
全文
関連したドキュメント
Comparing the Gauss-Jordan-based algorithm and the algorithm presented in [5], which is based on the LU factorization of the Laplacian matrix, we note that despite the fact that
⑥ニューマチックケーソン 職種 設計計画 設計計算 設計図 数量計算 照査 報告書作成 合計.. 設計計画 設計計算 設計図 数量計算
These results are motivated by the bounds for real subspaces recently found by Bachoc, Bannai, Coulangeon and Nebe, and the bounds generalize those of Delsarte, Goethals and Seidel
In the present work we determine the Poisson kernel for a ball of arbitrary radius in the cases of the spheres and (real) hyperbolic spaces of any dimension by applying the method
The layout produced by the VDCB algorithm is more evenly distributed according to the CP model, and is more similar to the original layout according to the similarity measures
0.1. Additive Galois modules and especially the ring of integers of local fields are considered from different viewpoints. Leopoldt [L] the ring of integers is studied as a module
Such bounds are of interest because they can be used to improve estimates of volumes of hyperbolic manifolds in much the same way that B¨ or¨ oczky’s bounds [B¨ o1], [B¨ o2] for
Our experimental setting consists of (i) a simpler, more intuitive format for storing binary trees in files; (ii) save/load routines for generating binary trees to files and