3206 search results - page 248 / 642 » How minds can be computational systems |
210
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
160
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...
167
click to vote
CHI
1997
ACM
15 years 10 months ago
1997
ACM
We report on an examination of work practice in a knowledge-based, document-intensive organisation and describe the role of paper in that work. We show how such an examination can...
131
click to vote
JC
2002
15 years 6 months ago
2002
It has been known how to use computational fixed point theorems to verify existence and uniqueness of a true solution to a nonlinear system of equations within a small region abou...
291
click to vote
ICOM
2011
14 years 10 months ago
2011
In this paper we describe an implicit user interface for smart environment control: We make our system guess how to assist the user(s) proactively. Our controller is based on two ...