Sciweavers

8663 search results - page 1720 / 1733
» 10 papers on network models
Sort
View
SIGCOMM
1998
ACM
15 years 1 months ago
Secure Group Communications Using Key Graphs
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
Chung Kei Wong, Mohamed G. Gouda, Simon S. Lam
74
Voted
RANDOM
1998
Springer
15 years 1 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
DAC
1997
ACM
15 years 1 months ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao
ECBS
1996
IEEE
127views Hardware» more  ECBS 1996»
15 years 1 months ago
Domain Engineering: The Challenge, Status, and Trends
Naval Surface Warfare Center Dahlgren Division; under joint sponsorship of the Office of Naval Research; the Naval Command, Control, and Ocean Surveillance Center; and the Naval S...
Stephanie White, Michael Edwards
EDCC
1994
Springer
15 years 1 months ago
Designing Secure and Reliable Applications using Fragmentation-Redundancy-Scattering: An Object-Oriented Approach
Security and reliability issues in distributed systems have been investigated for several years at LAAS using a technique called Fragmentation-Redundancy-Scattering (FRS). The aim ...
Jean-Charles Fabre, Yves Deswarte, Brian Randell
« Prev « First page 1720 / 1733 Last » Next »