3937 search results - page 172 / 788 » Questioning Ubiquitous Computing |
167
click to vote
APAL
2011
14 years 10 months ago
2011
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
120
click to vote
ISCA
1989
IEEE
15 years 7 months ago
1989
IEEE
: We explore the question: “What can a von Neumann processor borrow from dataflow to make it more suitable for a multiprocessor?’’ Starting with a simple, “RISC-like” ins...
102
click to vote
EMNLP
2008
15 years 5 months ago
2008
Knowing the degree of antonymy between words has widespread applications in natural language processing. Manually-created lexicons have limited coverage and do not include most se...
119
click to vote
AIS
2005
Springer
15 years 3 months ago
2005
Springer
Recent proposals for computer-assisted argumentation have drawn on dialectical models of argumentation. When used to assist public policy planning, such systems also raise questio...
138
Voted
DC
2007
15 years 3 months ago
2007
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...