Sciweavers

189 search results - page 34 / 38
» SCARAB: scaling reachability computation on large graphs
Sort
View
ICPP
2006
IEEE
15 years 3 months ago
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
David A. Bader, Kamesh Madduri
AAAI
2012
12 years 12 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
MOBIHOC
2008
ACM
15 years 9 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao
ICDCS
2007
IEEE
15 years 3 months ago
Distributed Resource Management and Admission Control of Stream Processing Systems with Max Utility
A fundamental problem in a large scale decentralized stream processing system is how to best utilize the available resources and admission control the bursty and high volume input...
Cathy H. Xia, Donald F. Towsley, Chun Zhang
AINA
2010
IEEE
15 years 2 months ago
Routing Loops in DAG-Based Low Power and Lossy Networks
Abstract—Directed Acyclic Graphs (DAGs), rooted at popular/default destinations, have emerged as a preferred mechanism to provide IPv6 routing functionality in large scale low po...
Weigao Xie, Mukul Goyal, Hossein Hosseini, Jerald ...