Sciweavers

19866 search results - page 377 / 3974
» Computing all factorizations in ***
Sort
View
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
15 years 6 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial
ICPPW
2002
IEEE
15 years 11 months ago
A Programming Methodology for Designing Block Recursive Algorithms on Various Computer Networks
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms on various computer networks. In our previ...
Min-Hsuan Fan, Chua-Huang Huang, Yeh-Ching Chung
SIGCSE
2008
ACM
119views Education» more  SIGCSE 2008»
15 years 6 months ago
Exploring studio-based instructional models for computing education
While the demand for college graduates with computing skills continues to rise, such skills no longer equate to mere programming skills. Modern day computing jobs demand design, c...
Christopher D. Hundhausen, N. Hari Narayanan, Mart...
EUROCRYPT
2007
Springer
16 years 1 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
SIGCSE
2006
ACM
130views Education» more  SIGCSE 2006»
16 years 24 days ago
Scavenger hunt: computer science retention through orientation
This paper describes Scavenger Hunt, a team-based orientation activity for incoming freshmen in the Department of Computer Science at the University of Illinois at Urbana-Champaig...
Jerry O. Talton, Daniel L. Peterson, Sam Kamin, De...