Sciweavers

745 search results - page 53 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
CDC
2008
IEEE
162views Control Systems» more  CDC 2008»
15 years 7 months ago
Average consensus by gossip algorithms with quantized communication
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
Paolo Frasca, Ruggero Carli, Fabio Fagnani, Sandro...
IWCMC
2010
ACM
15 years 2 months ago
A flow trace generator using graph-based traffic classification techniques
We propose a novel methodology to generate realistic network flow traces to enable systematic evaluation of network monitoring systems in various traffic conditions. Our technique...
Peter Siska, Marc Ph. Stoecklin, Andreas Kind, Tor...
94
Voted
IJCNN
2000
IEEE
15 years 5 months ago
Evolving Neural Network Structures Using Axonal Growth Mechanisms
In the eld of arti cial evolution creating methods to evolve neural networks is an important goal. But how to encode the structure and properties of the neural network in the geno...
Peter Eggenberger
131
Voted
CVPR
2010
IEEE
15 years 3 months ago
Ray Markov Random Fields for Image-Based 3D Modeling: Model and Efficient Inference
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
Shubao Liu, David Cooper
102
Voted
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 29 days ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky