3937 search results - page 478 / 788 » Questioning Ubiquitous Computing |
138
click to vote
AIL
2002
15 years 6 months ago
2002
This article is an exercise in computational jurisprudence. It seems clear that the field of AI and Law should draw upon the insights of legal philosophers, whenever possible. But...
148
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
195
click to vote
COMPUTER
2000
15 years 6 months ago
2000
hysical world. How do you adapt software abstractions designed merely to transform data to meet requirements like real-time constraints, concurrency, and stringent safety considera...
207
click to vote
STACS
2012
Springer
14 years 2 months ago
2012
Springer
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a...
202
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...