Sciweavers

4865 search results - page 729 / 973
» The Complexity of Graph Connectivity
Sort
View
TMC
2011
131views more  TMC 2011»
14 years 11 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
WWW
2011
ACM
14 years 11 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...
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 8 months ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert
ACSAC
2010
IEEE
14 years 8 months 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»
14 years 7 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...