Sciweavers

533 search results - page 90 / 107
» Playing games with approximation algorithms
Sort
View
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
14 years 2 months ago
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
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−(...
Per Austrin, Subhash Khot, Muli Safra
ICC
2011
IEEE
205views Communications» more  ICC 2011»
12 years 7 months ago
Decentralized Cross-Tier Interference Mitigation in Cognitive Femtocell Networks
—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...
Mehdi Bennis, Samir Medina Perlaza
GRAPHICSINTERFACE
2000
13 years 9 months ago
Animating Athletic Motion Planning By Example
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...
Ronald A. Metoyer, Jessica K. Hodgins
ATAL
2006
Springer
13 years 11 months ago
Predicting people's bidding behavior in negotiation
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...
Ya'akov Gal, Avi Pfeffer
ICCS
2009
Springer
14 years 2 months ago
Spatial Relations Analysis by Using Fuzzy Operators
Spatial relations play important role in computer vision, scene analysis, geographic information systems (GIS) and content based image retrieval. Analyzing spatial relations by Fo...
Nadeem Salamat, El-hadi Zahzah