3937 search results - page 454 / 788 » Questioning Ubiquitous Computing |
162
click to vote
LATIN
1998
Springer
15 years 11 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
167
click to vote
RT
1997
Springer
15 years 10 months ago
1997
Springer
Recently the light-field and lumigraph systems have been proposed as general methods of representing the visual information present in a scene. These methods represent this infor...
157
click to vote
STACS
1989
Springer
15 years 10 months ago
1989
Springer
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
167
click to vote
SP
1990
IEEE
15 years 10 months ago
1990
IEEE
This paper examines some questions concerning commercial computer security integrity policies. We give an example of a dynamic separation of duty policy which cannot be implemente...
153
click to vote
AINA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract-- The primary contribution of this paper is in a wireless sensor network's coverage analysis method, which focuses on both the coverage itself and its uniformity and ...