Sciweavers

484 search results - page 61 / 97
» Large graph processing in the cloud
Sort
View
SLS
2009
Springer
250views Algorithms» more  SLS 2009»
15 years 4 months ago
Running Time Analysis of ACO Systems for Shortest Path Problems
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
Christian Horoba, Dirk Sudholt
WWW
2001
ACM
15 years 10 months ago
Batch rekeying for secure group communications
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
Xiaozhou (Steve) Li, Yang Richard Yang, Mohamed G....
CSE
2009
IEEE
15 years 4 months ago
A Visual Interface for Social Information Filtering
Abstract—Collaborative or “Social” filtering has been successfully deployed over the years as a technique for analysing large amounts of user-preference knowledge to predict...
John O'Donovan, Brynjar Gretarsson, Svetlin Bostan...
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
15 years 4 months ago
A novel criticality computation method in statistical timing analysis
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
Feng Wang 0004, Yuan Xie, Hai Ju
PPOPP
2012
ACM
13 years 5 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao