Sep
25
Non-Adaptive Group Testing
Description Group testing is a well researched and practically important topic (e.g. in biological research). The basic idea of group testing is to perfectly identify a small portion of 'special'...
Events Archive
Find an Event
Currently selected filters
- Discrete Applied Math Seminar
Sep
18
Hydra Number of Graphs
Speaker Despina Stasi IIT Applied Math http://www.personal.psu.edu/~users/d/u/dus33/ Description In this talk we define and discuss the hydra number, a graph parameter arising from an optimization...
Sep
13
Graphs with χ = Δ have Big Cliques
Speaker Dan Cranston Virginia Commonwealth University http://www.people.vcu.edu/~dcranston/ Description Let G be a graph with maximum degree Δ ≥3. Brooks' Theorem says that if G has chromatic number Δ...
Sep
9
Active Learning: Past, Present, and Future
Speaker Mustafa Bilgic IIT Computer Science http://www.cs.iit.edu/~mbilgic/ Speaker http://www.iit.edu/csl/am/colloquia/abstracts/fall13_bilgic_mustafa.shtml Description A fundamental task of machine...
Sep
4
Introduction to group testing design matrices
Speaker Robert Ellis IIT Applied Math http://math.iit.edu/~rellis/ Description The point of group testing is to reduce the cost of finding defective items in a population by testing pools if items...
May
3
Crossing Number vs. Pairwise Crossing number of graphs
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
Counting Independent sets up to tree threshold
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
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...
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
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...