Series
ARC5 Distinguished Lecture

Permanent Link
https://hdl.handle.net/1853/70835
Series Type
Event Series
Description
Associated Organization(s)
Associated Organization(s)
Organizational Unit
Organizational Unit

Filters

2012 5
5
5
5
5
5
Reset filters

Settings

Publication Search Results

Now showing 1 - 5 of 5
  • No Thumbnail Available
    Item
    Sums of Squares In Optimization
    (Georgia Institute of Technology, 2012-08-28) Blekherman, Grigoriy ; Georgia Institute of Technology. Algorithms, Randomness and Complexity Center ; Georgia Institute of Technology. College of Computing ; Georgia Institute of Technology. School of Computer Science ; Georgia Institute of Technology. School of Mathematics ; Georgia Institute of Technology. School of Electrical and Computer Engineering
  • No Thumbnail Available
    Item
    Inverting Underdetermined Linear Systems Using Structure
    (Georgia Institute of Technology, 2012-08-28) Romberg, Justin ; Georgia Institute of Technology. Algorithms, Randomness and Complexity Center ; Georgia Institute of Technology. College of Computing ; Georgia Institute of Technology. School of Computer Science ; Georgia Institute of Technology. School of Mathematics ; Georgia Institute of Technology. School of Electrical and Computer Engineering
  • No Thumbnail Available
    Item
    On Graphs, Arithmetic Progressions and Communication
    (Georgia Institute of Technology, 2012-08-28) Alon, Noga ; Georgia Institute of Technology. Algorithms, Randomness and Complexity Center ; Georgia Institute of Technology. College of Computing ; Georgia Institute of Technology. School of Computer Science ; Georgia Institute of Technology. School of Mathematics ; Georgia Institute of Technology. School of Electrical and Computer Engineering ; Universiṭat Tel-Aviv
    Tools from extremal graph theory are helpful in the study of problems in additive number theory, theoretical computer science, and information theory. I will illustrate this fact by several closely related examples focusing on a recent one in a joint paper with Moitra and Sudakov .
  • No Thumbnail Available
    Item
    An Introduction to Additive Combinatorics Via 'Carries'
    (Georgia Institute of Technology, 2012-08-28) Diaconis, Persi ; Georgia Institute of Technology. Algorithms, Randomness and Complexity Center ; Georgia Institute of Technology. College of Computing ; Georgia Institute of Technology. School of Computer Science ; Georgia Institute of Technology. School of Mathematics ; Georgia Institute of Technology. School of Electrical and Computer Engineering ; Stanford University
    When numbers are added in the usual way, "carries" occur. The chance of a carry is about .45 (base 10). There are other choices of digits that lead to fewer carries (balanced digits). These balanced systems turn out to be best (fewest carries). Showing this requires an excursion into additive combinatorics a la Gowers-Green-Szemeredi-Tao. This is joint work with Shao and Soundarajan.
  • No Thumbnail Available
    Item
    Robotics and Vision
    (Georgia Institute of Technology, 2012-08-28) Dellaert, Frank ; Georgia Institute of Technology. Algorithms, Randomness and Complexity Center ; Georgia Institute of Technology. College of Computing ; Georgia Institute of Technology. School of Computer Science ; Georgia Institute of Technology. School of Mathematics ; Georgia Institute of Technology. School of Electrical and Computer Engineering