Sciweavers

376 search results - page 63 / 76
» Completely connected clustered graphs
Sort
View
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
14 years 1 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
SIGMOD
2011
ACM
270views Database» more  SIGMOD 2011»
12 years 10 months ago
Automatic discovery of attributes in relational databases
In this work we design algorithms for clustering relational columns into attributes, i.e., for identifying strong relationships between columns based on the common properties and ...
Meihui Zhang, Marios Hadjieleftheriou, Beng Chin O...
CIKM
2007
Springer
14 years 1 months ago
A dual-view approach to interactive network visualization
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
Galileo Namata, Brian Staats, Lise Getoor, Ben Shn...
IWCMC
2006
ACM
14 years 1 months ago
System approach to intrusion detection using hidden Markov model
In an era of cooperating ad hoc networks and pervasive wireless connectivity, we are becoming more vulnerable to malicious attacks. Many of these attacks are silent in nature and ...
Rahul Khanna, Huaping Liu
PADS
2005
ACM
14 years 1 months ago
Performance Benchmark of a Parallel and Distributed Network Simulator
Simulation of large-scale networks requires enormous amounts of memory and processing time. One way of speeding up these simulations is to distribute the model over a number of co...
Samson Lee, John Leaney, Tim O'Neill, Mark Hunter