Sciweavers

736 search results - page 117 / 148
» Approximating the Number of Network Motifs
Sort
View
VLDB
2001
ACM
139views Database» more  VLDB 2001»
15 years 2 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 4 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
PODC
2005
ACM
15 years 3 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ATAL
2004
Springer
15 years 3 months ago
Demonstration of the Secure Wireless Agent Testbed (SWAT)
We will demonstrate the Secure Wireless Agent Testbed (SWAT), a unique facility developed at Drexel University to study integration, networking and information assurance for next-...
Gustave Anderson, Andrew Burnheimer, Vincent A. Ci...
CCS
2004
ACM
15 years 3 months ago
Web tap: detecting covert web traffic
As network security is a growing concern, system administrators lock down their networks by closing inbound ports and only allowing outbound communication over selected protocols ...
Kevin Borders, Atul Prakash