5606 search results - page 339 / 1122 » Randomization Techniques for Graphs. |
169
click to vote
ICALP
2004
Springer
16 years 11 min ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
177
click to vote
SIGCOMM
2006
ACM
16 years 17 days ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
261
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
184
click to vote
EUROCRYPT
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
171
click to vote
TSP
2008
15 years 6 months ago
2008
A cross-layered slotted ALOHA protocol is proposed and analyzed for distributed estimation in sensor networks. Suppose that the sensors in the network record local measurements of ...