Sciweavers

1923 search results - page 101 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
IACR
2011
111views more  IACR 2011»
13 years 9 months ago
Secure Multi-Party Sorting and Applications
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
Kristján Valur Jónsson, Gunnar Kreit...
ICDCS
2002
IEEE
15 years 2 months ago
A Fully Distributed Framework for Cost-Sensitive Data Mining
Data mining systems aim to discover patterns and extract useful information from facts recorded in databases. A widely adopted approach is to apply machine learning algorithms to ...
Wei Fan, Haixun Wang, Philip S. Yu, Salvatore J. S...
CRYPTO
1989
Springer
163views Cryptology» more  CRYPTO 1989»
15 years 1 months ago
Undeniable Signatures
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
David Chaum, Hans Van Antwerpen
PC
2007
141views Management» more  PC 2007»
14 years 9 months ago
Physically based simulation of cloth on distributed memory architectures
Physically based simulation of cloth in virtual environments is a computationally demanding problem. It involves modeling the internal material properties of the textile (physical...
Bernhard Thomaszewski, Wolfgang Blochinger
NOSSDAV
2009
Springer
15 years 4 months ago
Probabilistic event resolution with the pairwise random protocol
Peer-to-peer distributed virtual environments (DVE's) distribute state tracking and state transitions. Many DVE's - such as online games - require ways to fairly determi...
John L. Miller, Jon Crowcroft