From awd at cs.cmu.edu Fri Jun 1 12:44:50 2012 From: awd at cs.cmu.edu (Artur Dubrawski) Date: Fri, 01 Jun 2012 12:44:50 -0400 Subject: [Research] important event this Saturday night Message-ID: <4FC8F182.6090706@cs.cmu.edu> Friends, Please join us at watching Jeff mature one more notch! (I suspect some confused people may be skeptical about the "maturing" part, but trust me: it is happening! Still having doubts? One more reason to come and check it out for yourself :) Where: Mario's (former Doc's) at Walnut and Bellefonte, upstairs When: 7:30pm on Saturday June 2nd. See you all there + please let everyone you know know about it and bring friends and relatives! Artur From schneide at cs.cmu.edu Thu Jun 7 13:14:06 2012 From: schneide at cs.cmu.edu (Jeff Schneider) Date: Thu, 07 Jun 2012 13:14:06 -0400 Subject: [Research] Auton Lab Meeting Friday at noon - NSH 1507 Message-ID: <4FD0E15E.3080003@cs.cmu.edu> Hi Everyone, Please come to an Auton Lab meeting tomorrow at noon in NSH 1507. There will be pizza for lunch. We will have a guest speaker, Marion Neumann, who has been visiting us the past few weeks from Fraunhofer IAIS in Deutschland. If we have time after her talk, we will also hear Roman present his ICML paper. Marion's talk abstract is: Propagation Kernels for Partially Labeled Graphs Learning from complex data is becoming increasingly important, and graph kernels have recently evolved into a rapidly developing branch of learning on structured data. However, previously proposed kernels rely on having discrete node label information. Propagation kernels leverage the power of continous node label distributions as kernel features and hence, enhance traditional graph kernels to efficiently handle partially labeled graphs in a principled manner. Utilizing locality-sensitive hashing, propagation kernels are able to outperform state-of-the-art graph kernels in terms of runtime without loss in prediction accuracy. This work investigates the power of propagation kernels to classify partially labeled images and to tackle the challenging problem of retrieving similar object views in robotic grasping. Jeff. From schneide at cs.cmu.edu Fri Jun 8 11:57:23 2012 From: schneide at cs.cmu.edu (Jeff Schneider) Date: Fri, 08 Jun 2012 11:57:23 -0400 Subject: [Research] Auton Lab Meeting Friday at noon - NSH 1507 In-Reply-To: <4FD0E15E.3080003@cs.cmu.edu> References: <4FD0E15E.3080003@cs.cmu.edu> Message-ID: <4FD220E3.9050002@cs.cmu.edu> Reminder: We're meeting now in NSH 1507. Jeff. On 06/07/2012 01:14 PM, Jeff Schneider wrote: > Hi Everyone, > > Please come to an Auton Lab meeting tomorrow at noon in NSH 1507. There will be > pizza for lunch. > > We will have a guest speaker, Marion Neumann, who has been visiting us the past > few weeks from Fraunhofer IAIS in Deutschland. If we have time after her talk, > we will also hear Roman present his ICML paper. Marion's talk abstract is: > > Propagation Kernels for Partially Labeled Graphs > > Learning from complex data is becoming increasingly important, and graph kernels > have recently evolved into a rapidly developing branch of learning on structured > data. However, previously proposed kernels rely on having discrete node label > information. Propagation kernels leverage the power of continous node label > distributions as kernel features and hence, enhance traditional graph kernels to > efficiently handle partially labeled graphs in a principled manner. Utilizing > locality-sensitive hashing, propagation kernels are able to outperform > state-of-the-art graph kernels in terms of runtime without loss in prediction > accuracy. This work investigates the power of propagation kernels to classify > partially labeled images and to tackle the challenging problem of retrieving > similar object views in robotic grasping. > > > Jeff. > > _______________________________________________ > Research mailing list > Research at autonlab.org > https://www.autonlab.org/mailman/listinfo/research From schneide at cs.cmu.edu Wed Jun 13 13:07:42 2012 From: schneide at cs.cmu.edu (Jeff Schneider) Date: Wed, 13 Jun 2012 13:07:42 -0400 Subject: [Research] Auton Lab meeting this Friday at noon! Message-ID: <4FD8C8DE.2070408@cs.cmu.edu> Dear Auton Lab, We will have a meeting this Friday at noon in NSH 1507. This is your chance to hear 3 ICML papers presented without even flying all the way to Scotland! The presentations will be by Barnabas, Roman, and Jeff (presenting for Yi). Lunch will be provided. Jeff. From schneide at cs.cmu.edu Fri Jun 15 12:00:53 2012 From: schneide at cs.cmu.edu (Jeff Schneider) Date: Fri, 15 Jun 2012 12:00:53 -0400 Subject: [Research] Auton Lab meeting this Friday at noon! In-Reply-To: <4FD8C8DE.2070408@cs.cmu.edu> References: <4FD8C8DE.2070408@cs.cmu.edu> Message-ID: <4FDB5C35.60505@cs.cmu.edu> Reminder: We're meeting now in NSH 1507 On 06/13/2012 01:07 PM, Jeff Schneider wrote: > > Dear Auton Lab, > > We will have a meeting this Friday at noon in NSH 1507. > > This is your chance to hear 3 ICML papers presented without even flying all the > way to Scotland! The presentations will be by Barnabas, Roman, and Jeff > (presenting for Yi). > > Lunch will be provided. > > Jeff. > > > _______________________________________________ > Research mailing list > Research at autonlab.org > https://www.autonlab.org/mailman/listinfo/research From awd at cs.cmu.edu Wed Jun 27 21:50:15 2012 From: awd at cs.cmu.edu (Artur Dubrawski) Date: Wed, 27 Jun 2012 21:50:15 -0400 Subject: [Research] Fwd: Book from former Autoner: Computational Fairy Tales In-Reply-To: References: Message-ID: <4FEBB857.2000303@cs.cmu.edu> Good stuff! Congrats Jeremy! Artur PS We have plenty of younger demographic in the Lab now :) -------- Original Message -------- Subject: Book from former Autoner: Computational Fairy Tales Date: Wed, 27 Jun 2012 19:58:23 -0400 From: Jeremy Kubica To: Artur Dubrawski , Jeff Schneider Artur and Jeff, This book ia aimed at a younger demographic, but I thought I would pass it along since I am a former Autonian. I am please to announce that the Computational Fairy Tales book is now available. The Computational Fairy Tales book includes ~30 rewritten or revised stories from the online collection and 15 all new chapters. Each story serves to illustrate a computational concept, supplementing official instruction or motivating computer science concepts. /Have you ever thought that computer science should include more dragons and wizards? Computational Fairy Tales introduces principles of computational thinking, illustrating high-level computer science concepts, the motivation behind them, and their application in a non-computer?fairy tale?domain. It?s a quest that will take you from learning the basics of programming in a blacksmith?s forge to fighting curses with recursion. Fifteen seers delivered the same prophecy, without so much as a single minstrel to lighten the mood: an unknown darkness threatens the kingdom. Suddenly, Princess Ann finds herself sent forth alone to save the kingdom. Leaving behind her home, family, and pet turtle Fido, Princess Ann must face goblin attacks, magical curses, arrogant scholars, an unpleasant oracle, and rude Boolean waiters. Along the way she must build a war chest of computational knowledge to survive the coming challenge./ The book is now available on in print and Kindle versions through Amazon. Please feel free to pass this along to anyone you think might be interested. - Jeremy