Sciweavers

13784 search results - page 2486 / 2757
» On Computing Functions with Uncertainty
Sort
View
SPAA
1993
ACM
14 years 1 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
SIGGRAPH
1992
ACM
14 years 1 months ago
Interactive inspection of solids: cross-sections and interferences
To reduce the cost of correcting design errors, assemblies of mechanical parts are modeled using CAD systems and verified electronically before the designs are sent to manufacturi...
Jarek Rossignac, Abe Megahed, Bengt-Olaf Schneider
ASIACRYPT
2007
Springer
14 years 1 months ago
Simple and Efficient Perfectly-Secure Asynchronous MPC
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
Zuzana Beerliová-Trubíniová, ...
DAC
2010
ACM
14 years 1 months ago
LUT-based FPGA technology mapping for reliability
As device size shrinks to the nanometer range, FPGAs are increasingly prone to manufacturing defects. We anticipate that the ability to tolerate multiple defects will be very impo...
Jason Cong, Kirill Minkovich
KDD
2010
ACM
203views Data Mining» more  KDD 2010»
14 years 1 months ago
Collusion-resistant privacy-preserving data mining
Recent research in privacy-preserving data mining (PPDM) has become increasingly popular due to the wide application of data mining and the increased concern regarding the protect...
Bin Yang, Hiroshi Nakagawa, Issei Sato, Jun Sakuma
« Prev « First page 2486 / 2757 Last » Next »