In this talk we essentially discuss a work on variational inequalities by Yuri Nestrov where the so called prox-functions play a major role. We discuss the approach in details giving complexity bounds and related results.
In this talk, we discuss three problems. The first is on an asynchronous multi-antenna wireless communication system and the later two are on collaborative estimation.
A centralized dynamic, opportunistic scheduling decision has to be made by a Base station (BS) to fair share the resources, based on the current channel gains signaled by the mobiles.
This will be a talk on the proof of NP hardness of the Art Gallery Problem (which was described by Pritam last week). Approximation algorithms for the terrain guarding problem will also be described.
