CSEP 521 - Projects - Winter 2007

CSE Home

About Us

Search

Contact Info

The project specifications:

My goal in this project is for you to spend some time exploring an algorithmic problem of genuine interest to you. This is not intended to be a lot of work, nor is it rigidly structured. I am happy for you to deviate from the high-level guidelines here as long as what you explore is relevant to applied algorithms. You are also welcome to work in small teams. Generally, I'd like you to explore one of the following:

• An algorithmic problem of interest to you or relevant to your work.
• An algorithmic problem whose solution is a key component in some companies' product.

1. By February 28, you need to submit by email to Anna and Roee a one paragraph description of the topic you have chosen. If you want to deviate significantly from the guidelines given here, please outline the way in which you will be deviating.
2. A 5 page (but no more!) writeup of your project will be due on March 12.
3. During the week of March 12, those of you that volunteer to do so will give a 10-15 minute talk about your project to the class. (I wanted all of you to give talks, but we unfortunately will not have the time for that, so the talk will be extra credit.)

• A precise description of the algorithmic problem and its applications.
• A discussion of alternative algorithmic approaches to the problem, including a discussion of their complexity, optimality, and relative merits. If you prefer, you are welcome to do a short implementation study of one or more algorithms and describe your experimental results.
• A discussion of at least one paper from the computer science literature about the problem.
• A discussion of the key open problems and challenges that remain in addressing this problem.

For inspiration (I'll try to add more later)

A small sample of companies that sell products that use various algorithms:

Optimization	Geometry and Meshing	Biology	Cryptography
CPLEX CAPS Logistics IBM OSL Astrokettle APC Carmen Systems Lindo Systems LogicTools	Fluent Geomagic Pointwise Ansys FEGS CFDRC Marc Femsys AVL	Celera Curagen HGSI MLNM Hyseq Genset Incyte Variagenics	Algorithmic Research RSA Security Entrust Cryptomathic Netegrity InterTrust Zero Knowledge Mach 5
Trick's List	Owen's List	Netsci's list	Rivest's List

	Department of Computer Science & Engineering University of Washington Box 352350 Seattle, WA  98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to karlin]