Sciweavers

2210 search results - page 217 / 442
» Information complexity of neural networks
Sort
View
IPM
2006
94views more  IPM 2006»
15 years 6 months ago
Binary Pathfinder: An improvement to the Pathfinder algorithm
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
Vicente P. Guerrero Bote, Felipe Zapico-Alonso, Ma...
CCS
2009
ACM
15 years 10 months ago
The bayesian traffic analysis of mix networks
This work casts the traffic analysis of anonymity systems, and in particular mix networks, in the context of Bayesian inference. A generative probabilistic model of mix network ar...
Carmela Troncoso, George Danezis
JMLR
2012
13 years 9 months ago
Graphlet decomposition of a weighted network
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
Hossein Azari Soufiani, Edo Airoldi
151
Voted
NOMS
2006
IEEE
146views Communications» more  NOMS 2006»
16 years 19 days ago
BGP-Inspect - Extracting Information from Raw BGP Data
— While BGP routing datasets, consisting of raw routing data, are freely available and easy to obtain, extracting any useful information is tedious. Currently, researcher and net...
Dionysus Blazakis, Manish Karir, John S. Baras
ICASSP
2009
IEEE
16 years 1 months ago
Distributed parameter estimation with selective cooperation
This paper proposes selective update and cooperation strategies for parameter estimation in distributed adaptive sensor networks. A setmembership filtering approach is employed t...
Stefan Werner, Yih-Fang Huang, Marcello L. R. de C...