3946 search results - page 590 / 790 » The computational complexity of choice sets |
183
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
244
click to vote
ICTAI
2003
IEEE
15 years 12 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
221
click to vote
SIBGRAPI
2003
IEEE
15 years 12 months ago
2003
IEEE
Creating models of real scenes is a complex task for which the use of traditional modelling techniques is inappropriate. For this task, laser rangefinders are frequently used to s...
197
click to vote
SASN
2003
ACM
15 years 12 months ago
2003
ACM
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be u...
170
click to vote
SC
2003
ACM
15 years 12 months ago
2003
ACM
We report on a model of the distribution of job submission interarrival times in supercomputers. Interarrival times are modeled as a consequence of a complicated set of decisions ...