Sciweavers

1631 search results - page 325 / 327
» Uniform Distributed Synthesis
Sort
View
CORR
2011
Springer
217views Education» more  CORR 2011»
12 years 11 months ago
Coarse-Grained Topology Estimation via Graph Sampling
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...
Maciej Kurant, Minas Gjoka, Yan Wang, Zack W. Almq...
INFOCOM
2011
IEEE
12 years 11 months ago
Sharing multiple messages over mobile networks
—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...
Yuxin Chen, Sanjay Shakkottai, Jeffrey G. Andrews
FAST
2011
12 years 11 months ago
FastScale: Accelerate RAID Scaling by Minimizing Data Migration
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...
Weimin Zheng, Guangyan Zhang
ICFP
2012
ACM
11 years 10 months ago
Nested data-parallelism on the gpu
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...
Lars Bergstrom, John H. Reppy
SIAMCOMP
2012
11 years 10 months ago
Randomized Competitive Algorithms for Generalized Caching
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 ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor