Sciweavers

21 search results - page 2 / 5
» Using relational knowledge discovery to prevent securities f...
Sort
View
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 5 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
CORR
2010
Springer
175views Education» more  CORR 2010»
13 years 5 months ago
Detecting Security threats in the Router using Computational Intelligence
Information security is an issue of global concern. As the Internet is delivering great convenience and benefits to the modern society, the rapidly increasing connectivity and acc...
J. Visumathi, K. L. Shunmuganathan
ACNS
2011
Springer
237views Cryptology» more  ACNS 2011»
12 years 9 months ago
Private Discovery of Common Social Contacts
The increasing use of computing devices for social interactions propels the proliferation of online social applications, yet, it prompts a number of privacy concerns. One common p...
Emiliano De Cristofaro, Mark Manulis, Bertram Poet...
CCS
2009
ACM
14 years 6 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
ADHOC
2007
144views more  ADHOC 2007»
13 years 5 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac