Sciweavers

19866 search results - page 375 / 3974
» Computing all factorizations in ***
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 10 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
TPDS
2002
198views more  TPDS 2002»
15 years 6 months ago
Orthogonal Striping and Mirroring in Distributed RAID for I/O-Centric Cluster Computing
This paper presents a new distributed disk-array architecture for achieving high I/O performance in scalable cluster computing. In a serverless cluster of computers, all distribute...
Kai Hwang, Hai Jin, Roy S. C. Ho
HUC
2010
Springer
15 years 5 months ago
UBI challenge workshop 2010: real world urban computing
This workshop promotes ubiquitous computing research in authentic urban setting, with real users and with sufficient scale and time span. We first motivate why such research is im...
Timo Ojala, Jukka Riekki
ITICSE
2006
ACM
16 years 24 days ago
Once she makes it, she is there: gender differences in computer science study
When you sit in a Computer Science lecture at any university in the western world, what are the chances that the person sitting next to you will be a woman? Furthermore, what are ...
Tamar Vilner, Ela Zur
ICIP
2009
IEEE
16 years 7 months ago
Secure Distortion Computation Among Untrusting Parties Using Homomorphic Encryption
Alice and Bob possess sequences xn and yn respectively and would like to compute d(xn , yn ) where d(., .) is a distortion measure. However, Alice and Bob do not trust each other ...