Sciweavers

265 search results - page 29 / 53
» Generating an Assortative Network with a Given Degree Distri...
Sort
View
IPPS
2005
IEEE
14 years 2 months ago
Message Scheduling for All-to-All Personalized Communication on Ethernet Switched Clusters
We develop a message scheduling scheme that can theoretically achieve the maximum throughput for all–to–all personalized communication (AAPC) on any given Ethernet switched cl...
Ahmad Faraj, Xin Yuan
SIGMOD
2006
ACM
171views Database» more  SIGMOD 2006»
14 years 8 months ago
Communication-efficient distributed monitoring of thresholded counts
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
Ram Keralapura, Graham Cormode, Jeyashankher Ramam...
NDSS
2009
IEEE
14 years 3 months ago
CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable
We describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, we can generate a pseudo-random sequence and a proof that the elem...
Michael Backes, Peter Druschel, Andreas Haeberlen,...
ISQED
2009
IEEE
137views Hardware» more  ISQED 2009»
14 years 3 months ago
Active decap design considerations for optimal supply noise reduction
Active decoupling capacitors (decaps) are more effective than passive decaps at reducing local IR-drop problems in the power distribution network. In the basic active decap, two p...
Xiongfei Meng, Resve A. Saleh
COCOON
2007
Springer
14 years 2 months ago
On the Hardness of Optimization in Power Law Graphs
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...
Alessandro Ferrante, Gopal Pandurangan, Kihong Par...