Sciweavers

14098 search results - page 2684 / 2820
» Crowd computer interaction
Sort
View
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
14 years 3 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
DIGRA
2005
Springer
14 years 3 months ago
Framing Virtual Law
Building on the work of games theorists and virtual world designers, this paper proposes a framework for understanding the real-virtual dichotomy in terms of a series of five fram...
Peter Edelmann
DIGRA
2005
Springer
14 years 3 months ago
The Pervasive Interface; Tracing the Magic Circle
This paper is an addition to the discourse surrounding interface theory and pervasive games. A buzzword by nature, the term ´interface´ needs to be investigated and redefined in...
Eva Nieuwdorp
DIGRA
2005
Springer
14 years 3 months ago
'Feel It, Don't Think: the Significance of Affect in the Study of Digital Games
Game studies methodologies which focus on the visual, narrative, and semiotic content of digital games overlook the way that embodied perception and physiological response contrib...
Eugenie Shinkle
DRM
2005
Springer
14 years 3 months ago
DRM interoperability analysis from the perspective of a layered framework
Interoperability is currently seen as one of the most significant problems facing the digital rights management (DRM) industry. In this paper we consider the problem of interoper...
Gregory L. Heileman, Pramod A. Jamkhedkar
« Prev « First page 2684 / 2820 Last » Next »