Sciweavers

14774 search results - page 189 / 2955
» Computational complexity and evolutionary computation
Sort
View
JIPS
2007
131views more  JIPS 2007»
15 years 4 months ago
A Practical Privacy-Preserving Cooperative Computation Protocol without Oblivious Transfer for Linear Systems of Equations
: We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equa...
Ju-Sung Kang, Dowon Hong
PERCOM
2004
ACM
16 years 4 months ago
Programming Pervasive and Mobile Computing Applications with the TOTA Middleware
Pervasive computing calls for suitable middleware and programming models to deal with large software systems dived in dynamic mobile network environments. Here we present the prog...
Marco Mamei, Franco Zambonelli
ICC
2007
IEEE
15 years 11 months ago
Computing Maximum-Likelihood Bounds for Reed-Solomon Codes over Partial Response Channels
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
Richard M. Todd, J. R. Cruz
PADS
2005
ACM
15 years 10 months ago
Optimistic Parallel Discrete Event Simulations of Physical Systems Using Reverse Computation
Efficient computer simulation of complex physical phenomena has long been challenging due to their multiphysics and multi-scale nature. In contrast to traditional time-stepped exe...
Yarong Tang, Kalyan S. Perumalla, Richard M. Fujim...
CORR
2004
Springer
94views Education» more  CORR 2004»
15 years 4 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson