Sciweavers

5793 search results - page 1131 / 1159
» Individual communication complexity
Sort
View
ASIACRYPT
2001
Springer
14 years 4 days ago
Fully Distributed Threshold RSA under Standard Assumptions
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a pr...
Pierre-Alain Fouque, Jacques Stern
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 4 days ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
ICMCS
2000
IEEE
84views Multimedia» more  ICMCS 2000»
14 years 1 days ago
Multi-modal Interaction in the Age of Information Appliances
The coming millenium will be characterized by the availability of multiple information appliances that make ubiquitous information access an accepted fact of life. The ability to ...
Stéphane H. Maes, T. V. Raman
ICPP
2000
IEEE
14 years 23 hour ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
IPPS
2000
IEEE
14 years 14 hour ago
Run-Time Support for Adaptive Load Balancing
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
Milind A. Bhandarkar, Robert Brunner, Laxmikant V....
« Prev « First page 1131 / 1159 Last » Next »