114 search results - page 6 / 23 » Practical algorithms for subgroup detection in covert networ... |
CORR
2012
Springer
12 years 3 months ago
2012
Springer
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
WWW
2010
ACM
14 years 2 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
JPDC
2006
13 years 7 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
ADHOCNOW
2006
Springer
14 years 1 months ago
2006
Springer
We consider an ad-hoc network consisting of devices that try to gain access for transmission through a shared communication channel. We redesign randomized protocol of Cai, Lu and ...
ACSAC
2006
IEEE
14 years 1 months ago
2006
IEEE
Network Intrusion Detection Systems (NIDS) have become crucial to securing modern networks. To be effective, a NIDS must be able to counter evasion attempts and operate at or near...