News Archive, Aladdin Center

News Archive page2,
see previous news

In the News
October 21, 2001: Robot solves Internet robot problem. By Byron Spice, Pittsburgh Post-Gazette. "It's become a major problem on the Internet, as has the use of 'bots to register for e-mail addresses that are later used to send unwanted advertisements, or spam, to e-mail users. [Manuel] Blum's research team at Carnegie Mellon University has come up with a solution to the problem, one that the Web portal Yahoo implemented last month." read the article Dannie Durand Receives Packard Foundation Award. Associate Professor of Biology and Computer Science, Dannie Durand receives prestigious fellowship from the David and Lucile Packard Foundation. She is among twenty-four of the most promising science and engineering researchers at 22 universities across the United States that have been awarded a five-year fellowship worth $625,000 each.Click here to read more. Click here to find out more about the Packard Foundation Award. Durand also received a Genome Scholar Faculty Transition award from the National Institutes of Health for $1,000,000 to be spent over 4 years. The award is intended to "promote exceptionally talented,new investigators in genomic research..." and will support her research program in computational genomics on the analysis of gene duplication in vertebrates. more about Dannie Durand Dan Blandford and Guy Blelloch received Honorable Mentions for their project, Index Compression Through Document Reordering. This project aims to reduce the space requirements of an inverted index by clustering together documents that are similar before assigning numerical identifiers to the documents (leading to locality in the document identifier sequences within the inverted posting lists for the words in the index, thereby making the sequences more compressible with various types of encoding techniques). read more Honored professor stumps computers By Jonathan Potts, TRIBUNE-REVIEW, Thursday, May 16, 2002 Manuel Blum is just as interested in deciphering what a computer can do as what it can't do. read the article Can Hard AI Problems Foil Internet Interlopers? By Sara Robinson, SIAM As a way to articulate and make use of the hardness of Turing's imitation game, Captchas are clearly a success read the article October 21, 2001: Robot solves Internet robot problem. By Byron Spice, Pittsburgh Post-Gazette. "It's become a major problem on the Internet, as has the use of 'bots to register for e-mail addresses that are later used to send unwanted advertisements, or spam, to e-mail users. [Manuel] Blum's research team at Carnegie Mellon University has come up with a solution to the problem, one that the Web portal Yahoo implemented last month." read the article The Future OF Women in the Technical Fields. May 14, 2002. Nominated by Women@SCS, Dr Anita Borg, founder of Systers and the Institute for Women and Technology received an honorary degree at this year's commencement. Dr. Borg has been a pivotal figure in the field of computer science and is a role model for women around the world pursuing careers in technology. Read more Mor Harchol-Balter is this year's recipient of the Herbert A. Simon Award for Teaching Excellence in Computer Science "[Her] teaching style makes the transition from implemented technologies to unsolved research problems an invisible boundary." Human or Computer? Take This Test read the article Manuel Blum Elected to the National Academy of Sciences read more
Past Workshops	Courses
Workshop on Auction Theory and Practice. November 7-8, 2003 read more REU Summer 2003 Symposia. August 14 and 19, 2003 read more College Workshop. June 26-28, 2003 read more Machine Learning, Statistics, and Discovery Conference. June 22 - June 26, 2003 read more Computational Molecular Biology Symposium. March 12th, 2003. visit the website Privacy in DATA Workshop. March 27-28, 2003 read more REU Summer 2002 Symposia Talks given by ALADDIN Center participants in the ALADDIN Summer 2002 REU (Research Experience for Undergraduates) Program. more information Meshing Infrastructure Workshop: A Mini Roundtable for Sharing Meshing Infrastructurer, Research, and Resources. September 18, 2002. more information Graph Partitioning in Vision and Machine Learning Workshop more information Integrated Logistics Workshop October 31 - November 1, 2002 more information First Workshop on Human Interactive Proofs. January 2002. more information	The regularity Lemma/Extremal Graph Theory 211-801, Fall 2002 Instructor: Ryan Martin Prerequisites: A knowldge of graph theory and some discrete probability APPROXIMATION ALGORITHMS 47-850 Mini IV, 2002 Instructor: Lisa Fleischer (239 Posner, 268-5902) Schedule: Tuesdays, 10:00-12:00, GSIA 227, Thursdays 10:30-12:30, GSIA 227 This course can be viewed as a continuation of 47-849, but can also be taken independently. We will focus on approximation algorithms for hard combinatorial problems, with an emphasis on network problems, but will also discuss some fast algorithms or approximations to polynomial solvable problems.