Sciweavers

2519 search results - page 333 / 504
» Martingales and Locality in Distributed Computing
Sort
View
ISPDC
2005
IEEE
15 years 9 months ago
GMRES Method on Lightweight GRID System
Grid computing accomplishes high throughput computing by using a very large number of unexploited computing resources. We present a parallel method GMRES to solve large sparse lin...
Haiwu He, Guy Bergére, Serge G. Petiton
152
Voted
INDOCRYPT
2003
Springer
15 years 9 months ago
On Multiplicative Linear Secret Sharing Schemes
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
FGCS
2007
89views more  FGCS 2007»
15 years 3 months ago
Federated grid clusters using service address routed optical networks
Clusters of computers have emerged as cost-effective parallel and/or distributed computing systems for computationally intensive tasks. Normally, clusters are composed of high per...
Isaac D. Scherson, Daniel S. Valencia, Enrique Cau...
135
Voted
CCR
2005
76views more  CCR 2005»
15 years 3 months ago
Simplifying the synthesis of internet traffic matrices
A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial i...
Matthew Roughan
PODC
2009
ACM
16 years 4 months ago
Tight bounds for clock synchronization
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer