Sciweavers

3937 search results - page 198 / 788
» Questioning Ubiquitous Computing
Sort
View
114
Voted
JCSS
2006
63views more  JCSS 2006»
15 years 3 months ago
Error-bounded probabilistic computations between MA and AM
We introduce the probabilistic class SBP which is defined in a BPP-like manner. This class emerges from BPP by keeping the promise of a probability gap but decreasing the probabil...
Elmar Böhler, Christian Glaßer, Daniel ...
159
Voted
MOBIQUITOUS
2008
IEEE
15 years 10 months ago
ScreenSpot: multidimensional resource discovery for distributed applications in smart spaces
The big challenge related to the contemporary research on ubiquitous and pervasive computing is that of seamless integration. For the next generation of ubiquitous and distributed...
Marko Jurmu, Sebastian Boring, Jukka Riekki
EUC
2005
Springer
15 years 9 months ago
Collision Attack on XTR and a Countermeasure with a Fixed Pattern
Public-key cryptosystem (PKC) is one of inevitable key technologies in order to accomplish fruitful security applications in ubiquitous computing systems. The ubiquitous computer o...
Dong-Guk Han, Tsuyoshi Takagi, Tae-Hyun Kim, Howon...
PERCOM
2003
ACM
16 years 3 months ago
Using Semantic Networks for Knowledge Representation in an Intelligent Environment
When building intelligent spaces, the knowledge representation for encapsulating rooms, users, groups, roles, and other information is a fundamental design question. Here we prese...
Stephen Peters, Howard E. Shrobe
ICALP
2005
Springer
15 years 9 months ago
A Finite Basis for Failure Semantics
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
Wan Fokkink, Sumit Nain