Events

Upcoming Events

Fri
Oct 21
11:00 AM
UTA 7.532

Combinatorial design theory has its roots in recreational mathematics and is concerned with the arrangement of the elements of a finite set into subsets, such that the collection of subsets has certain “nice” properties. In this talk we shall demonstrate that interpreting designs in the right manner yields improved solutions for distributed storage and content caching and novel impossibility results for distributed function computation.

Recent Events

16 Sep 2016

Everyone has some experience of solving jigsaw puzzles. When facing ambiguities of assembling a pair of pieces, a common strategy we use is to look at clues from additional pieces and make decisions among all relevant pieces together. In this talk, I will show how to apply this common practice to develop data-driven algorithms that significantly outperform pair-wise algorithms. I will start with describing a computation framework for the joint inference of correspondences among shape/image collections.

25 Mar 2016
This talk will present recent work from the Socially Intelligent Machines Lab.
26 Feb 2016

Abstract: This talk will present a number of candidate technologies for vehicle to vehicle and vehicle to infrastructure communications. In more detail it will describe 802.11p and LTE applied for vehicular applications. The effect of vehicle speed, packet size and antenna correlation will be described. Simulation and emulation results will be presented. Then we will consider the challenges and opportunities of mmWave for vehicular communications.

19 Feb 2016

This talk surveys the state-of-the art in RFID, energy-harvesting sensors, and devices for the Internet of Things.  Everything you know about wireless communications will be challenged, as we discuss ultra-low energy RF devices, bizarre forms of modulation, ``smart’’ antennas that do not require power, and undulating waveforms that extend the physical limits of RF energy-harvesting.  We present the engineering breakthroughs of today that will lead to real Sci-Fi applications of tomorrow:  peel-and-stick radio sensors that last forever, mm-scale wireless location capability, and de

18 Feb 2016

Abstract: How much of space can be filled with pairwise non-overlapping copies of a given solid? This is one of the oldest problems in mathematics, intriguing since the times of Aristotle, and remaining remarkably elusive until present times. For example, the three-dimensional sphere packing problem (posed by Kepler in 1611) was only solved in 1998 by Ferguson and Hales.