———- Forwarded message ———-
From: James Fogarty <jfogarty@cs.washington.edu>
Date: Fri, Mar 10, 2017 at 9:12 AM
Subject: [cs-ugrads] CSE 440 Final Poster Session: HCI / Self-Tracking: Monday at 11:00 in CSE Atrium
To: Researchers <researchers@cs.washington.edu>, cs-ugrads@cs.washington.edu
Please join us to see 16 projects exploring different approaches to self-tracking. Teams of students have explored everything from mobile health and wellness apps, to a smart bookmark, to a talking mirror, to an adorable panda that watches you drive:
Teams of students have spent the quarter identifying a problem, conducting fieldwork to better understand the opportunity, exploring potential designs, and refining those designs in iterative testing. They are currently finalizing their websites and deliverables, but take a sneak peek above.
We’ll be in the CSE atrium on Monday @ 11:00.
There will be cookies, and we’re co-hosting with the CSE Accessibility Capstone.
Please join us!
James and the CSE 440 staff and students
March 10, 2017
———- Forwarded message ———-
From: Ed Lazowska <lazowska@cs.washington.edu>
Date: Wed, Mar 8, 2017 at 4:20 PM
Subject: [cs-ugrads] Chaos in the Atrium!
To: “cs-ugrads@cs.washington.edu” <cs-ugrads@cs.washington.edu>
On Thursday starting at 3:30 we’ll be hosting an event for about 450
people (alumni, friends in the professional community, and UW leadership) celebrating the start of
our 50th Anniversary year. (In March 1967, the UW Board of Regents
created the “Computer Science Group” and authorized the granting of
graduate degrees.)
Apologies for the inconvenience!
_______________________________________________
Cs-ugrads mailing list
Cs-ugrads@cs.washington.edu
https://mailman.cs.washington.edu/mailman/listinfo/cs-ugrads
March 8, 2017
From: Alexander Lefort <aalefort@cs.washington.edu>
Date: Fri, Mar 3, 2017 at 3:48 PM
Subject: [cs-ugrads] Ants in CSE003 Lab
To: cs-ugrads@cs.washington.edu
Cc: Cse-Maintenance <cse-maintenance@cs.washington.edu>
Hello All,
Recently there have been several sightings of ants in the CSE003 lab. These have mostly occurred near the two laptop benches nearest the hall. We have contacted a pest control expert who has since laid down several traps with ant poison in them. Please do not disturb these traps.
We would also like to remind everyone to please dispose of any food waste brought into the labs in the proper receptacles. This will help to minimize future troubles with pests.
If you have any questions or concerns, please contact CSE-maintenance@cs.washington.edu.
Thank you,
Alexander Lefort
Facilities & Events Coordinator
Computer Science & Engineering
University of Washington
Box 352350
206.685.9198
March 7, 2017
Hey everybody,
Just a super early heads up, we are having a spring BBQ on May 19th from 4:00 to 7:30. So put that in your calendars!
As for stuff this week,
· February 28th, 6 p.m., Google tech talk, EE105
· March 1st, 11 a.m., Voyager office hours, table in the Atrium
· March 1st, 1:30 p.m., SPECIAL ANIMATION PRESENTATION AND Q&A, Guggenheim 220
ACM
February 27, 2017
Hey everyone,
Stat 391, prereq 312, isn’t allowing some students to register right now but the stat dept is aware of the issue and working on getting it fixed. If you have trouble registering, you can contact the stat advisor at:
|
statugradadv@stat.washington.edu |
February 21, 2017
CSE 522: Algorithms and Uncertainty
Instructors: Nikhil Devanur (MSR) and Anna Karlin
Time and Place: Mondays and Fridays from 11:00am — 12:20pm
In this course, we will explore some of the key themes and approaches to handling uncertainty in algorithm
design and analysis, with particular emphasis on basics of learning theory and online learning.
Topics to be covered will be selected from:
* Basics of learning theory: PAC learning, sample complexity, uniform convergence, VC theory, Rademacher complexity
* Online learning: MWU, Follow the perturbed leader, applications
* Online convex optimization: gradient descent, regularization, FTRL, Bregman divergence, online mirror descent
* Multi-armed bandits: stochastic and adversarial cases, linear bandits, Gittins index.
* Competitive analysis of online algorithms: online primal-dual, online stochastic packing
* Secretary problems and prophet inequalities
* Models intermediate between worst-case and average-case analysis.
Course evaluation: 2-4 homeworks and a presentation on a paper related to the course content.
Background expected: Mathematical maturity, probability and undergraduate level algorithms (e.g. 421)
February 21, 2017