Properly colored copies and rainbow copies of large graphs with small maximum degree Description Counting Independent sets up to tree threshold : We consider the problem of counting a given weighted...
A Polynomial Approximation to the Matrix Permanent via Markov Chain Monte Carlo. Description Algorithms for the Min-Cut problem : The project will discuss the Min-Cut problem, and introduce some...
SpeakerMing YuanUniversity of Wisconsin-Madisonhttp://pages.stat.wisc.edu/~myuan/Site/Welcome.html Description We consider several estimation problems in functional data analysis. These examples...
Mazin Safar, Director, Industrial Technology and Management; F. Quinn Stepan, Jr.; and Dr. Bob Carlson, Dean, IIT School of Applied Technology INTM’s 2013 “Outstanding Leader in Industry”, F. Quinn...
Subgraphs of random graphs with specified degrees Description Improved Bounds on Coloring of Graphs : This paper by Sokol Ndreca, Aldo Procacci, Benedetto Scoppola (2011) has several improvements on...
SpeakerYan ChenNorthwestern Universityhttp://www.cs.northwestern.edu/~ychen/ Description Abstract Mobile devices are becoming increasingly popular. One reason for their popularity is the availability...
Propagation of Information in a Network Description Cardinality of 2 and Higher Distance Sets: This presentation focuses on an improved upper bound on the cardinality of a 2-distance set proved by...
Description Abstract Threats on the stability of a financial system may severely affect the functioning of the entire economy, and thus considerable emphasis is placed on the analyzing the cause and...
Description The area of non-adaptive group testing is a well-sought topic in recent years. The general problem is - we have a large set of elements, N which contains some 'special items'. The (sub)set...
On Counting Weighted Graph Homomorphisms Description Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovasz Local Lemma : The Lovasz Local Lemma is a useful tool for making...
