Sciweavers

3378 search results - page 130 / 676
» A universe of binding and computation
Sort
View
PERCOM
2004
ACM
15 years 9 months ago
Anatomy of a Graduate Ubiquitous/Pervasive Computing Course
This paper presents the author's experience in designing and teaching a graduate level Ubiquitous Computing (Ubicomp) course at Arizona State University. It identifies some o...
S. K. S. Gupta
CAD
2004
Springer
14 years 9 months ago
Turtle geometry in computer graphics and computer-aided design
: LOGO is a programming language incorporating turtle graphics, originally devised for teaching computing to young children in elementary and middle schools. Here we advocate the u...
Ron Goldman, Scott Schaefer, Tao Ju
HICSS
2007
IEEE
138views Biometrics» more  HICSS 2007»
15 years 4 months ago
Online Education in Computer and Digital Forensics: A Case Study
Computer forensics is a relatively new, but growing, field of study at the undergraduate college and university level. This paper describes some of the course design aspects of te...
Gary C. Kessler
IANDC
2008
139views more  IANDC 2008»
14 years 10 months ago
Computational complexity of dynamical systems: The case of cellular automata
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
Pietro di Lena, Luciano Margara
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
15 years 10 months ago
Complete Fairness in Multi-party Computation without an Honest Majority
Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study...
S. Dov Gordon, Jonathan Katz