377 search results - page 36 / 76 » Distributed computation under bit constraints |
184
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
186
click to vote
SENSYS
2009
ACM
16 years 20 days ago
2009
ACM
The programming and retasking of sensor nodes could benefit greatly from the use of a virtual machine (VM) since byte code is compact, can be loaded on demand, and interpreted on...
127
click to vote
GLOBECOM
2006
IEEE
15 years 12 months ago
2006
IEEE
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
166
click to vote
TWC
2008
15 years 5 months ago
2008
In this paper, the problem of choosing constellation size and transmit power that minimizes the energy-per-goodbit in a frequency-flat, long-term static fading channel is considere...
135
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...