Sciweavers

646 search results - page 120 / 130
» Generalized connected domination in graphs
Sort
View
WWW
2011
ACM
13 years 3 months ago
Finding hierarchy in directed online social networks
Social hierarchy and stratification among humans is a well studied concept in sociology. The popularity of online social networks presents an opportunity to study social hierarch...
Mangesh Gupte, Pravin Shankar, Jing Li, S. Muthukr...
ACSAC
2010
IEEE
13 years 8 days ago
Friends of an enemy: identifying local members of peer-to-peer botnets using mutual contacts
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...
Baris Coskun, Sven Dietrich, Nasir D. Memon
SIGMOD
2011
ACM
270views Database» more  SIGMOD 2011»
12 years 11 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...
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
14 years 2 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
WWW
2010
ACM
14 years 3 months ago
Empirical comparison of algorithms for network community detection
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...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney