3378 search results - page 214 / 676 » A universe of binding and computation |
153
click to vote
TPDS
1998
15 years 6 months ago
1998
—A matrix A of size m n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 i < j m, the minimum value in row j lies below or to...
171
click to vote
LISA
1994
15 years 8 months ago
1994
Managing large scale UNIX networks so that users can use resources on multiple systems is traditionally performed using NIS, NFS, and DNS. Proper use of these tools requires exact...
170
click to vote
IIE
2007
15 years 6 months ago
2007
Two years ago the Faculty of Mathematics and Informatics at Sofia University makes a decision to design a new series of Logo-based courses which make use of the modern technology....
171
click to vote
COGSCI
2004
15 years 6 months ago
2004
I show how a conversational process that takes simple, intuitively meaningful steps may be understood as a sophisticated computation that derives the richly detailed, complex repr...
169
click to vote
TCC
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...