Sciweavers

3378 search results - page 166 / 676
» A universe of binding and computation
Sort
View
EUROCRYPT
2008
Springer
15 years 8 months ago
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
Nishanth Chandran, Vipul Goyal, Amit Sahai
TPDS
2010
185views more  TPDS 2010»
15 years 4 months ago
All-Pairs: An Abstraction for Data-Intensive Computing on Campus Grids
s: An Abstraction for Data Intensive Computing on Campus Grids Christopher Moretti, Hoang Bui, Karen Hollingsworth, Brandon Rich, Patrick Flynn, and Douglas Thain Department of Com...
Christopher Moretti, Hoang Bui, Karen Hollingswort...
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 6 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
CORR
1998
Springer
110views Education» more  CORR 1998»
15 years 6 months ago
laboratories for Data Communications and Computer Networks
Abstract In this paper we describe a hands-on laboratory oriented instructional package that we have developed for data communications and networking. The package consists of a sof...
Rohit Goyal, Steve Lai, Raj Jain, Arjan Durresi
PODC
1999
ACM
15 years 10 months ago
Wait-Free Synchronization in Multiprogrammed Systems: Integrating Priority-Based and Quantum-Based Scheduling
d Abstract) James H. Anderson Department of Computer Science University of North Carolina at Chapel Hill Mark Moiry Department of Computer Science University of Pittsburgh We cons...
James H. Anderson, Mark Moir