Sciweavers

315 search results - page 50 / 63
» Eigenvalue bounds for independent sets
Sort
View
PDCAT
2005
Springer
14 years 3 months ago
A New Algorithm to Solve Synchronous Consensus for Dependent Failures
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
Jun Wang, Min Song
ASIACRYPT
2004
Springer
14 years 3 months ago
Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk
AOSD
2003
ACM
14 years 3 months ago
Model-view-controller and object teams: a perfect match of paradigms
From the early days of object-oriented programming, the model-view-controller paradigm has been pursued for a clear design which separates different responsibilities within an in...
Matthias Veit, Stephan Herrmann
HPDC
2002
IEEE
14 years 2 months ago
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...
Kavitha Ranganathan, Ian T. Foster
ICNP
1998
IEEE
14 years 2 months ago
Receiver-based Multicast Scoping: A New Cost-Conscious Join/Leave Paradigm
In Internet multicast, the set of receivers can be dynamic with receivers joining and leaving a group asynchronously and without the knowledge of the sources. The Internet today u...
George F. Riley, Mostafa H. Ammar, Lenitra M. Clay