Events Archive

Find an Event

Sep
21

Time

to

Locations

E1 124

Locations

Description Finding a bipartite subgraph with maximum number of edges in a given graph is a classical problem in combinatorial optimization and extremal graph theory. It has been studied in computer...

Sep
18

Time

to

Locations

E1 106

Locations

Description This talk concentrates on the model-robust design problem for multiresponse model with possible bias. We assume that the fitted model for each response is first-degree or second-degree...

Sep
7

Time

to

Locations

E1 124

Locations

Description Abstract: The most famous and useful characterization of k-connected graphs is Menger's Theorem, but there is another, very nice but little-known characterization of a wholly different...

Apr
21

Time

to

Locations

E1 106

Locations

SpeakerMichael G RoecknerPurdue Universityhttp://www.stat.purdue.edu/people/faculty/roeckner Description We shall first review the connection between ordinary stochastic differential equations (SODE)...