2473 search results - page 229 / 495 » The Logic of Communication Graphs |
216
click to vote
WSDM
2012
ACM
14 years 2 months ago
2012
ACM
In this work we propose a novel approach to anomaly detection in streaming communication data. We first build a stochastic model for the system based on temporal communication pa...
216
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
146
click to vote
CASES
2009
ACM
16 years 1 months ago
2009
ACM
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
202
click to vote
ICOIN
2007
Springer
16 years 24 days ago
2007
Springer
Exploring topological structure at Autonomous System (AS) level is indispensable for understanding most issues in Internet services. Previous models of AS graph involve address or ...
157
click to vote
MSN
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...