Do you want to be a Web Developer who is deeply passionate about the web and loves to learn
how to make user experiences fascinating and dynamic? Do you have a solid understanding of
how the web works, including security and best development practices? You define creativity
combined with strong coding skills, understanding of technological trends and know that our
existing customers demand great things for their custom solutions. You like to help us with our
innovative projects to meet and exceed customer expectations for the best Backflip experience
Leading engineers at Swoop Search will discuss some of the most interesting technical challenges that their team has overcome as they established their innovative search platform. Some of these challenges include handling unstructured data in real-time, creating a custom index, deploying in a highly secure environment, defining patterns that are both mathematically significant and data agnostic, and creating an intuitive UI that empowers both non-technical users and experienced analysts.
CS graduation reception for PHD graduates and their invited guests. There will be complimentray appetizers and a formal presentation to celebrate the achievements of the graduates. Photographer will be present to take photos.
University-wide PHD commencement at 5:30 in the Kohl Center.
Abstract: Optimization is an indispensable tool in modern data analysis. A wide range of tasks, including training models for image classification, medical diagnosis, and prediction of natural disasters can be formulated as optimization problems. Given the scale and complexity of modern data sets and associated optimization problems, there is a real need for highly-efficient general-purpose optimization methods.
I will examine how procedures for optimally searching through "multiplex" networks (networks made of multiple simple graphs) capture human learning and search patterns. Prior work on semantic memory (people's memory for facts and concepts) has primarily focused on modeling similarity judgments of pairs of words as distances between points in a high-dimensional space (e.g., LSA by Landauer et al, 1998; Word2Vec by Mikolov et al. 2013).