Events Archive

Find an Event

May
3

Time

to

Locations

E1 122

Locations

Description The crossing number of a graph $G$, $\crs(G)$ is the minimum number of intersections among edges over all possible drawings on a plane. The pairwise crossing number $\pcr(G)$ is the...

May
2

Time

to

Locations

E1 102

Locations

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...

Apr
30

Time

to

Locations

E1 102

Locations

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...

Apr
29

Time

to

Locations

LS 152

Locations

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...