Sciweavers

1189 search results - page 17 / 238
» Information Concealing Games
Sort
View
IEEECIT
2010
IEEE
13 years 8 months ago
Parallel Best Neighborhood Matching Algorithm Implementation on GPU Platform
—Error concealment restores the visual integrity of image content that has been damaged due to a bad network transmission. Best neighborhood matching (BNM) is an effective image ...
Guangyong Zhang, Liqiang He, Yanyan Zhang
PUC
2002
74views more  PUC 2002»
13 years 9 months ago
Smart Playing Cards: A Ubiquitous Computing Game
Abstract. We present the "Smart Playing Cards" application, a ubiquitous computing game that augments a classical card game with information
Kay Römer, Svetlana Domnitcheva
NIPS
2007
13 years 11 months ago
Regret Minimization in Games with Incomplete Information
Extensive games are a powerful model of multiagent decision-making scenarios with incomplete information. Finding a Nash equilibrium for very large instances of these games has re...
Martin Zinkevich, Michael Johanson, Michael H. Bow...
NIME
2005
Springer
150views Music» more  NIME 2005»
14 years 3 months ago
Sonictroller
The Sonictroller was originally conceived as a means of introducing competition into an improvisatory musical performance. By reverse-engineering a popular video game console, we ...
David Hindman, Spencer Kiser
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
14 years 3 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman