Sciweavers

69 search results - page 4 / 14
» The Element of Surprise in Timed Games
Sort
View
ICPR
2010
IEEE
13 years 7 months ago
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
Luisa Micó, José Oncina
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 7 months ago
Efficient Approximation of Optimal Control for Markov Games
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
Markus Rabe, Sven Schewe, Lijun Zhang
CG
2010
Springer
13 years 5 months ago
A Principled Method for Exploiting Opening Books
We used in the past a lot of computational power and human expertise for having a very big dataset of good 9x9 Go games, in order to build an opening book. We improved a lot the al...
Romaric Gaudel, Jean-Baptiste Hoock, Julien Perez,...
CHI
2003
ACM
14 years 7 months ago
Where on-line meets on the streets: experiences with mobile mixed reality games
We describe two games in which online participants collaborated with mobile participants on the city streets. In the first, the players were online and professional performers wer...
Martin Flintham, Steve Benford, Rob Anastasi, Terr...
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
14 years 20 days ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...