17 search results - page 4 / 4 » Hardness and Approximation of Traffic Grooming |
KDD
2008
ACM
14 years 10 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
MOBIHOC
2009
ACM
14 years 10 months ago
2009
ACM
In this paper, we consider a non-saturated IEEE 802.11 based wireless network. We use a three-way fixed point to model the node behavior with Bernoulli packet arrivals and determi...