Sciweavers

1245 search results - page 39 / 249
» Playing with Conway's problem
Sort
View
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
13 years 11 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
FSTTCS
2008
Springer
13 years 8 months ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn
CVPR
2010
IEEE
13 years 5 months ago
Group motion segmentation using a Spatio-Temporal Driving Force Model
We consider the `group motion segmentation' problem and provide a solution for it. The group motion segmentation problem aims at analyzing motion trajectories of multiple obj...
Ruonan Li, Rama Chellappa
ICIP
2004
IEEE
14 years 9 months ago
Facial similarity across age disguise illumination and pose
Illumination, pose variations, disguises, aging effects and expression variations are some of the key factors that affect the performance of face recognition systems. Face recogni...
Narayanan Ramanathan, Rama Chellappa, Amit K. Roy ...
ICALP
2009
Springer
14 years 2 months ago
Qualitative Concurrent Stochastic Games with Imperfect Information
Abstract. We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players...
Vincent Gripon, Olivier Serre