Sciweavers

1923 search results - page 109 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ICDE
2005
IEEE
100views Database» more  ICDE 2005»
15 years 11 months ago
Configurable Security Protocols for Multi-party Data Analysis with Malicious Participants
Standard multi-party computation models assume semi-honest behavior, where the majority of participants implement protocols according to specification, an assumption not always pl...
Bradley Malin, Edoardo Airoldi, Samuel Edoho-Eket,...
CCS
2007
ACM
15 years 4 months ago
Non-volatile memory and disks: avenues for policy architectures
As computing models change, so too do the demands on storage. Distributed and virtualized systems introduce new vulnerabilities, assumptions, and performance requirements on disks...
Kevin R. B. Butler, Stephen E. McLaughlin, Patrick...
AINA
2006
IEEE
14 years 11 months ago
Distributed Tuning Attempt Probability for Data Gathering in Random Access Wireless Sensor Networks
In this paper, we study the problem of data gathering in multi-hop wireless sensor networks. To tackle the high degree of channel contention and high probability of packet collisi...
Haibo Zhang, Hong Shen
HPDC
1999
IEEE
15 years 2 months ago
Toward a Common Component Architecture for High-Performance Scientific Computing
This paper describes work in progress to develop a standard for interoperability among high-performance scientific components. This research stems from growing recognition that th...
Robert C. Armstrong, Dennis Gannon, Al Geist, Kata...
ICDCN
2009
Springer
15 years 4 months ago
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
Amos Korman