Sciweavers

6568 search results - page 1183 / 1314
» Reducing the Complexity of Reductions
Sort
View
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 8 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
CLUSTER
2008
IEEE
15 years 8 months ago
Efficient one-copy MPI shared memory communication in Virtual Machines
Efficient intra-node shared memory communication is important for High Performance Computing (HPC), especially with the emergence of multi-core architectures. As clusters continue ...
Wei Huang, Matthew J. Koop, Dhabaleswar K. Panda
FSE
2008
Springer
193views Cryptology» more  FSE 2008»
15 years 8 months ago
New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba
The stream cipher Salsa20 was introduced by Bernstein in 2005 as a candidate in the eSTREAM project, accompanied by the reduced versions Salsa20/8 and Salsa20/12. ChaCha is a varia...
Jean-Philippe Aumasson, Simon Fischer 0002, Shahra...
AAAI
2010
15 years 8 months ago
Efficient Lifting for Online Probabilistic Inference
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
Aniruddh Nath, Pedro Domingos
NSDI
2010
15 years 7 months ago
WebProphet: Automating Performance Prediction for Web Services
Today, large-scale web services run on complex systems, spanning multiple data centers and content distribution networks, with performance depending on diverse factors in end syst...
Zhichun Li, Ming Zhang, Zhaosheng Zhu, Yan Chen, A...
« Prev « First page 1183 / 1314 Last » Next »