Sciweavers

494 search results - page 94 / 99
» Heap Building Bounds
Sort
View
PARA
1995
Springer
15 years 5 months ago
ScaLAPACK Tutorial
Abstract. ScaLAPACK is a library of high performance linear algebra routines for distributed memory MIMD computers. It is a continuation of the LAPACK project, which designed and p...
Jack Dongarra, Antoine Petitet
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 3 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
DGO
2007
124views Education» more  DGO 2007»
15 years 3 months ago
Assessing capability for justice information sharing
Enhanced information sharing among criminal justice agencies is a critical concern and a goal of much IT investment. Understanding agencies’ capabilities to achieve this goal is...
Anthony M. Cresswell, Theresa A. Pardo, Shahidul H...
IPCO
2007
108views Optimization» more  IPCO 2007»
15 years 3 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
OPODIS
2008
15 years 3 months ago
Solving Atomic Multicast When Groups Crash
In this paper, we study the atomic multicast problem, a fundamental abstraction for building faulttolerant systems. In the atomic multicast problem, the system is divided into non...
Nicolas Schiper, Fernando Pedone