Events Archive

Find an Event

Oct
23

Time

to

Locations

E1 106

Locations

Description Inpainting, or image interpolation, has broad applications in visual perception, digital media, and information technology. Compared with other classical interpolation problems (such as...

Oct
5

Time

to

Locations

E1 124

Locations

Description Abstract: Recently, there have been papers indicating that the maximal ratio combiner device can result in energy savings in wireless ad hoc networks by using Hitch-hiking. We study the...

Sep
28

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
25

Time

to

Locations

E1 106

Locations

Description We present a parameterized algorithm that, given a graph G on n vertices and an integer parameter k, decides whether G has an independent set of size at most k in time O(2^{2.1152k+0.1028n...

Sep
22

Time

to

Locations

E1 121

Locations

SpeakerCaroline Klivanshttp://people.cs.uchicago.edu/~klivans/ Description Degree sequences of graphs have been thoroughly studied. For example, there are many characterizations for those integer...