You are here

CT.L3B-01

Cache-Oblivious Computations: Algorithms and Experimental Evaluation

Description: 
Discussion based on techniques and analysis for handling massive data sets. Analysis of algorithms is discussed from the perspective of I/O complexity and the cache-oblivious model. Related topics include the Longest Common Subsequence problem, recursion, bioinformatics, priority queue, heaps and Gaussian Elemination. This is a very mathematical treatment.

Computing in the Developing World

Description: 
This presentation asks the question "Can computing help solve some of the problems in the rest of the world?" The project of scaling up a healthcare systemin Rwanda is explored by the presenter

Cryptography and Security - or - Fun (and Important) Tricks with Math and CS

Description: 
An accessible introduction to the intriguing field of cryptography including an overview of the history and mathematics of the field, as well as direct examples of how high-school-level mathematics correlate to cryptography techniques. Slides, sample cryptograms with solutions, a cipher reference sheet and a Visual Cryptogram from Paul Allen Center are included here.

Eliza, Computer Therapist

Description: 
ELIZA is an interactive, Web-based AI simulation, written in JavaScript. Introduction (from the Web site): "ELIZA emulates a Rogerian psychotherapist. ELIZA has almost no intelligence whatsoever, only tricks like string substitution and canned responses based on keywords. Yet when the original ELIZA first appeared in the 60's, some people actually mistook her for human.

Exploring Computer Science

Description: 
The Exploring Computer Science (ECS) materials available at: http://www.exploringcs.org/ providing daily lesson plans and resources which support the teaching of six instructional units: 1) Human Computer Interaction; 
2) Problem Solving; 
3) Web Design; 
4) Introduction to Programming; 
5) Robotics; and 
6) Computing Applications.

Fast String Searching

Description: 
This presentation talks about the need for string searching within large volumes of text. The Boyer-Moore fast string searching algorithm is demonstrated with extensive examples. A sample pseudocode implementation is provided and discussed.

MobileASL: Making Cell Phones Accessible to the Deaf Community

Description: 
This team of computer scientists is doing work to make cell phones more accessible to the deaf using American Sign Language (ASL). Constraints, research, experiments and results are discussed.

Power of Randomness in Computation

Description: 
The presenter talks about the usefulness of randomness in CS noting algorithms, Monte Carlo simulations, cryptography. He explores the generation of pseudo-random numbers and the quality of random numbers generated including the minimal randomness requirement.

Teaching the Principles of Computation

Description: 
Professor Tom Cortina provides an interesting overview of the Principles of Computation including its definition, algorithms visualization, correctness, efficienc, computability, artificial intelligence and other topics; some sample problems are briefly explored

The RFID Ecosystem

Description: 
This presentation on RFID (Radio Frequency Identification) and the involvementof the CS community includes information on its current status, current applications and futureuses s of this technology. Issues related to security and privacy are also addressed.

Pages

Subscribe to CT.L3B-01