Sciweavers

103 search results - page 21 / 21
» Design guidelines for simulation building blocks
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 9 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
CGF
2007
158views more  CGF 2007»
13 years 5 months ago
Manipulating, Deforming and Animating Sampled Object Representations
A sampled object representation (SOR) defines a graphical model using data obtained from a sampling process, which takes a collection of samples at discrete positions in space in...
Min Chen, Carlos D. Correa, Shoukat Islam, Mark W....
SIGCOMM
2012
ACM
11 years 7 months ago
Mirror mirror on the ceiling: flexible wireless links for data centers
Modern data centers are massive, and support a range of distributed applications across potentially hundreds of server racks. As their utilization and bandwidth needs continue to ...
Xia Zhou, Zengbin Zhang, Yibo Zhu, Yubo Li, Saipri...