Sciweavers

1167 search results - page 139 / 234
» Relational Markov Games
Sort
View
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 8 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
ICMCS
1999
IEEE
135views Multimedia» more  ICMCS 1999»
14 years 2 months ago
Do Software Engineers Like Multimedia?
Multimedia is not a dream anymore. Nowadays we use images (e.g., GIF, JPEG, and BMP), videos (e.g., MPEG, AVI, and QuickTime), and sounds (e.g., MIDI and WAV) as well as alphanume...
Masahito Hirakawa
STACS
1999
Springer
14 years 2 months ago
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
Clemens Lautemann, Nicole Schweikardt, Thomas Schw...
IJCAI
2003
13 years 11 months ago
Intelligent Multimedia Indexing and Retrieval through Multi-source Information Extraction and Merging
This paper reports work on automated meta-data creation for multimedia content. The approach results in the generation of a conceptual index of the content which may then be searc...
Jan Kuper, Horacio Saggion, Hamish Cunningham, Thi...
AIR
2006
147views more  AIR 2006»
13 years 10 months ago
Virtual human animation in natural language visualisation
Simulation motion of Virtual Reality (VR) objects and humans has experienced1 important developments in the last decade. However, realistic virtual human animation gen-2 eration re...
Minhua Ma, Paul McKevitt