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 …
The IEEE 802.11s working group was tasked to provide ways of establishing and securing a wireless mesh network. One proposal established a Mesh Security Architecture (MSA), with a developed key hierarchy and full protocol definitions. This talk examines the correctness and security of the MSA proposal and its corresponding protocols. …
Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees. However, in linear inverse problems such as deconvolution, tomography, and compressed sensing, the presence of a sensing or observation matrix leads to reconstruction problems that are intractable or non-convex optimizations. Past work has dealt …
This talk will follow up on last week’s SILO talk by Prof. Ellenberg. In particular, this will be a discussion about the “EDSN” algorithm for robust and efficient hierarchical clustering. Hierarchical clustering based on pairwise similarities is a common tool used in a broad range of scientific applications. However, in …