Sciweavers

3937 search results - page 190 / 788
» Questioning Ubiquitous Computing
Sort
View
CIE
2005
Springer
15 years 9 months ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
ALENEX
2004
110views Algorithms» more  ALENEX 2004»
15 years 5 months ago
Computation of a Class of COntinued Fraction Constants
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
Loïck Lhote
SCIENTOMETRICS
2010
122views more  SCIENTOMETRICS 2010»
15 years 2 months ago
A comparison of bibliometric indicators for computer science scholars and journals on Web of Science and Google Scholar
Abstract. Given the current availability of different bibliometric indicators and of production and citation data sources, the following two questions immediately arise: do the in...
Massimo Franceschet
SUTC
2006
IEEE
15 years 9 months ago
The Computational Complexity of Enforceability Validation for Generic Access Control Rules
In computer security, many researches have tackled on the possibility of a unified model of access control, which could enforce any access control policies within a single unified...
Vincent C. Hu, D. Richard Kuhn, David F. Ferraiolo
IEEEAMS
2003
IEEE
15 years 9 months ago
Smart Doorplates - Toward an Autonomic Computing System
The last three decades proved Moore’s Law. We witnessed an exponential increase in processing power, memory capacity and communication bandwidth and we expect this increase to c...
Wolfgang Trumler, Faruk Bagci, Jan Petzold, Theo U...