搜索结果: 1-7 共查到“计算数学其他学科 computation”相关记录7条 . 查询时间(0.143 秒)
It is a great pleasure to announce the 7th Workshop on Quantum Many-Body Computation, which will be held in Beijing from May 5 to 7, 2017. This workshop is organized by the University of Chinese Acade...
2017 PKU Workshop on Computation and Big Data Analysis
2017 PKU Workshop Computation and Big Data Analysis
2017/3/28
The rapid growth of data starts to inflict a major impact in many fields such as computational mathematics, optimization, statistics, computer science, etc. Big data analysis is a new and exciting dir...
A Saddle Point Approach to the Computation of Harmonic Maps
harmonic maps nonlinear constraints saddle point problem error estimates
2012/8/8
A Saddle Point Approach to the Computation of Harmonic Maps。
Infinite Time Cellular Automata: A Real Computation Model
Infinite Time Cellular Automata Computation Model
2010/12/28
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and infinite inputs; thu...
On the computation of non-perturbative effective potentials in the string theory landscape -- IIB/F-theory perspective
computation non-perturbative effective potentials theory landscape -- IIB/F-theory perspective
2010/12/16
We discuss a number of issues arising when computing non-perturbative e ects systematically across the string theory landscape. In particular, we cast the study of fairly generic physical properties i...
Counting Method for Multi-party Computation over Non-abelian Groups
Multiparty Passive Adversary Non-Abelian Groups Graph Coloring Neighbor-Avoiding Walk Random Walk
2012/12/3
In the Crypto’07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. The function to be computed is fG(x1, . . . , xn) := x1 · . . . · xn whe...
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Multiparty Computation Passive Adversary Non-Abelian Groups Graph Coloring Percolation Theory
2012/12/3
Recently, Desmedt et al. studied the problem of achieving secure nparty computation over non-Abelian groups. They considered the passive adversary model and they assumed that the parties were only all...