Sciweavers

1982 search results - page 244 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
NIPS
2007
15 years 4 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh
HPDC
2005
IEEE
15 years 9 months ago
411 on scalable password service
In this paper we present 411, a password distribution system for high performance environments that provides security and scalability. We show that existing solutions such as NIS ...
Federico D. Sacerdoti, Mason J. Katz, Philip M. Pa...
ICS
2005
Tsinghua U.
15 years 8 months ago
Continuous Replica Placement schemes in distributed systems
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
Thanasis Loukopoulos, Petros Lampsas, Ishfaq Ahmad
SASN
2005
ACM
15 years 8 months ago
Key distribution and update for secure inter-group multicast communication
Group communication has become an important component in wireless networks. In this paper, we focus on the environments in which multiple groups coexist in the system, and both in...
Weichao Wang, Bharat K. Bhargava
ICPADS
1994
IEEE
15 years 7 months ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...