Apr
30
Algortithms for the Min-Cut problem
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...
Events Archive
Find an Event
Apr
29
Optimal Estimation of Functional Data
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...
Apr
26
Industrial Awards Dinner Brings New Friends and Support to INTM
Mazin Safar, Director, Industrial Technology and Management; F. Quinn Stepan, Jr.; and Dr. Bob Carlson, Dean, IIT School of Applied Technology INTM鈥檚 2013 鈥淥utstanding Leader in Industry鈥, F. Quinn...
Apr
25
Improved Bounds on Coloring of Graphs
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...
Apr
25
Towards a Trustworthy Android Ecosystem
SpeakerYan ChenNorthwestern Universityhttp://www.cs.northwestern.edu/~ychen/ Description Abstract Mobile devices are becoming increasingly popular. One reason for their popularity is the availability...
Apr
23
Cardinality of 2 and Higher Distance Sets
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...
Apr
22
On Measuring and Evaluating Global Stability of Financial Networks
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...
Apr
19
Non-Adaptive Group Testing and the Group Sum Design
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...
Apr
18
Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovasz Local Lemma
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...
Apr
16
Analysis of condition numbers and preconditioning techniques for RBF matrices
Event Topic: Computational Mathematics & Statistics