Sciweavers

149 search results - page 27 / 30
» On Finding Minimum Deadly Sets for Directed Networks
Sort
View
SIGMOD
2006
ACM
171views Database» more  SIGMOD 2006»
14 years 7 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...
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
14 years 7 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
13 years 5 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...
TSP
2010
13 years 2 months ago
Distributed learning in multi-armed bandit with multiple players
We formulate and study a decentralized multi-armed bandit (MAB) problem. There are distributed players competing for independent arms. Each arm, when played, offers i.i.d. reward a...
Keqin Liu, Qing Zhao
IWCMC
2006
ACM
14 years 1 months ago
TARP: trust-aware routing protocol
Security is a critical issue in a mobile ad hoc network (MANET). In most of the previous protocols security is an added layer above the routing protocol. We propose a TrustAware R...
Loay Abusalah, Ashfaq A. Khokhar, G. BenBrahim, W....