Sciweavers

425 search results - page 37 / 85
» Adaptive Network Flow Clustering
Sort
View
CCS
2009
ACM
16 years 1 months ago
Automatic discovery of botnet communities on large-scale communication networks
Botnets are networks of compromised computers infected with malicious code that can be controlled remotely under a common command and control (C&C) channel. Recognized as one ...
Wei Lu, Mahbod Tavallaee, Ali A. Ghorbani
ICML
2007
IEEE
16 years 1 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
100
Voted
ICCS
2004
Springer
15 years 6 months ago
Distributed Collaborative Adaptive Sensing for Hazardous Weather Detection, Tracking, and Predicting
A new data-driven approach to atmospheric sensing and detecting/ predicting hazardous atmospheric phenomena is presented. Dense networks of small high-resolution radars are deploye...
Jerry Brotzge, V. Chandresakar, Kelvin Droegemeier...
83
Voted
CEC
2009
IEEE
15 years 4 months ago
JubiTool: Unified design flow for the Perplexus SIMD hardware accelerator
This paper presents a new unified design flow developed within the Perplexus project that aims to accelerate parallelizable data-intensive applications in the context of ubiquitous...
Olivier Brousse, Jérémie Guillot, Th...
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
15 years 7 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl