Sciweavers

205 search results - page 11 / 41
» An Algorithmic Analysis of the Honey-Bee Game
Sort
View
IAT
2009
IEEE
16 years 23 days ago
Bilateral Bargaining with One-Sided Two-Type Uncertainty
It is a challenging problem to find agents’ rational strategies in bargaining with incomplete information. In this paper we perform a game theoretic analysis of agents’ ratio...
Bo An, Nicola Gatti, Victor R. Lesser
MM
2006
ACM
157views Multimedia» more  MM 2006»
15 years 12 months ago
Player action recognition in broadcast tennis video with applications to semantic analysis of sports game
Recognition of player actions in broadcast sports video is a challenging task due to low resolution of the players in video frames. In this paper, we present a novel method to rec...
Guangyu Zhu, Changsheng Xu, Qingming Huang, Wen Ga...
NOSSDAV
2005
Springer
15 years 11 months ago
Using n-trees for scalable event ordering in peer-to-peer games
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
Chris GauthierDickey, Virginia Mary Lo, Daniel Zap...
PAMI
2007
186views more  PAMI 2007»
15 years 5 months ago
Value-Directed Human Behavior Analysis from Video Using Partially Observable Markov Decision Processes
—This paper presents a method for learning decision theoretic models of human behaviors from video data. Our system learns relationships between the movements of a person, the co...
Jesse Hoey, James J. Little
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
16 years 6 months ago
Balanced max 2-sat might not be the hardest
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
Per Austrin