1631 search results - page 325 / 327 » Uniform Distributed Synthesis |
154
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
115
click to vote
INFOCOM
2011
IEEE
14 years 6 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
220
click to vote
FAST
2011
14 years 5 months ago
2011
Previous approaches to RAID scaling either require a very large amount of data to be migrated, or cannot tolerate multiple disk additions without resulting in disk imbalance. In t...
272
click to vote
ICFP
2012
ACM
13 years 4 months ago
2012
ACM
Graphics processing units (GPUs) provide both memory bandwidth and arithmetic performance far greater than that available on CPUs but, because of their Single-Instruction-Multiple...
152
click to vote
SIAMCOMP
2012
13 years 4 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...