Title: Active Ranking using Pairwise Comparisons by Kevin Jamieson This talk examines the problem of ranking a collection of objects using pairwise comparisons (rankings of two objects). In general, the ranking of n objects can be identified by standard sorting methods using n log2 n pairwise comparisons. We are interested …
Meg Mitchell creates work in diverse media from video, to performance, digital media and interactive installations. She uses humor to subvert formalist interpretations of her work, and to play with the boundaries between the conceptual and the physical spaces her work occupies. Mitchell borrows from a diverse range of sources …
Title: Metamaterial Lens Modeling for mm-wave MIMO Communications by John Brady The capacity requirements of wireless communications are expanding rapidly with the proliferation of consumer wireless devices. Millimeter wave communication systems are uniquely suited to high data-rate applications not only due to large bandwidths but also small wavelengths that enable …
Cooperative Communication: Backpressure Algorithm with Mutual Information Accumulation By Nick Yanpei Liu We develop scheduling policies that maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. When the link quality between nodes is not sufficiently high that a …
Andrew Bridy and Lalit Jain will tell us about their experience at Boston’s Music Hack Day. They’ll describe their metamorphosis from number theorists to music hackers, their awesome new hack, and their perspectives on the future of music.
Abstract: We review the eigen-analysis and convex polytope approaches for the development of sparse approximation and compressed sensing algorithms. Problems which can be recast as convex relaxations are amenable to a precise analysis, but non-convex formulated algorithms have a dramatically less precise theoretical understanding. We present a gpu accelerated software …
Configuration spaces of hard spheres (in two dimensions, hard disks) are fundamental objects in topology as well as physics. Yet so far very little is known about the topology of these spaces. I will report on joint work with G. Carlsson, J. Gorham, and J. Mason on developing computational Morse …
Bubacarr’s talk: ABSTRACT: Restricted Isometry Constants (RICs) of a matrix are a popular tool in the analysis of compressed sensing algorithms. The best known bounds will be presented for Gaussian matrices as well as expander graphs. In the former case we will also present explicit formulae for the bounds in …
Gongguo’s talk: Title: Computable Bounds on Sparsity Recovery Abstract: The performance of sparsity recovery depends on the structures of the sensing matrices. The quality of these matrices in the context of signal recovery is usually quantified by the restricted isometry constant and its variants. However, the restricted isometry constant and …
Suppose given a set S of objects, together with some measure of dissimilarity between pairs of objects in S. It is an old and much-studied problem to find good embeddings of S into standard metric spaces (like the real plane, or a binary tree) so that the dissimilarities between objects …