Oct
23
Inpainting and Visual Interpolation
Description Inpainting, or image interpolation, has broad applications in visual perception, digital media, and information technology. Compared with other classical interpolation problems (such as...
Events Archive
Find an Event
Oct
9
Sampling-Based Methods for Stochastic Optimization
Speaker Tito Homem-de-Mello https://users.iems.northwestern.edu/~tito/ Description Joint colloquium with IIT ECE Dept.
Oct
5
Min-Energy Broadcast with Hitch-hiking
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...
Oct
4
Indifference price with unbounded processes and claims: an Orlicz space approach
Description We consider a financial market where the discounted prices of the assets available for trading are modeled by a semimartingale that is not assumed to be locally bounded. In this case, the...
Sep
28
Finding largebipartite subgraphs (Part 2 of 2)
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
Chebyshev collocation methods for resolving spike dynamics in the GM reaction-diffusion model
Description In this work the Gierer-Meinhardt model is analyzed using Chebyshev collocation methods. This model is classified as a reaction-diffusion system and arises from biological pattern...
Sep
25
On the Parameterized Complexity of Independent Set
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
Generalized Degree Sequences
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...
Sep
21
Finding large bipartite subgraphs (Part 1 of 2)
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
Robust Design for Linear Multiresponse Models with Possible Bias
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...