We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
—In this paper, recent results in game theory and stochastic approximation are brought together to mitigate the problem of femto-to-macrocell cross-tier interference. The main re...
Character animation is usually reserved for highly skilled animators and computer programmers because few of the available tools allow the novice or casual user to create compelli...
This paper presents a statistical learning approach to predicting people's bidding behavior in negotiation. Our study consists of multiple 2-player negotiation scenarios wher...
Spatial relations play important role in computer vision, scene analysis, geographic information systems (GIS) and content based image retrieval. Analyzing spatial relations by Fo...