搜索结果: 1-8 共查到“计算机科学技术基础学科 computation”相关记录8条 . 查询时间(0.078 秒)
Individual Addressing in Quantum Computation through Spatial Refocusing
Individual Addressing Quantum Computation Spatial Refocusing
2016/1/23
Separate addressing of individual qubits is a challenging requirement for scalable quantum computation, and crosstalk between operations on neighboring qubits remains a significant source of error for...
Maturity and Performance of Programmable Secure Computation
secure computation Performance
2015/12/22
Secure computation (SC) stands for a group of technologies for computing functions
of private inputs, while keeping the inputs themselves hidden. The canonical
example of secure computation is the m...
Computational Soundness of Uniformity Properties for Multi-party Computation based on LSSS
Computational Soundness Uniformity Properties
2015/12/21
We provide a symbolic model for multi-party computation
based on linear secret-sharing scheme, and prove that this model is computationally
sound: if there is an attack in the computational world, t...
DNA Computation Based Approach for Enhanced Computing Power
DNA Computation Computing Power Evolutionary Computing
2015/7/22
DNA computing is a discipline that aims at harnessing individual molecules at the nano-scopic level for computational purposes. Computation with DNA molecules possesses an inherent interest for resear...
Knowledge based Replica Management in Data Grid Computation
Consistency DBMS Data Grid KRE Knowledgebase Management Meta Ontology
2015/7/21
As the number of scientific disciplines has increased, the large data collections are emerging as important community resources. In domains as high energy physics, and computational genomic, the volum...
Computation Of Flows with Shocks Using Spectral Difference Scheme with Arti
Computation Flows Shocks Spectral Difference Scheme
2015/7/3
The current work focuses on applying an arti cial viscosity approach to the Spectral Di erence (SD) method to enable high-order computation of compressible uid ows with discontinuities. The study modi...
Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation
Local Search:Tight Bound Randomized Fixed-Point Computation
2012/12/3
In 1983, Aldous proved that randomization can speedup local search. For example, it reduces the query complexity of local search over grid [1 : n]d from Θ(nd−1) to O(d1/2nd/2). It remains open w...
Real-time scheduling based on imprecise computation for scalable streaming media system over the internet
Real-time scheduling imprecise computation scalable streaming media system
2010/12/14
This paper proposes a performance metrics and a real-time scheduling algorithm based on imprecise computation workload
model for delivery of scalable streaming media, which can be adapted to network ...