409 search results - page 73 / 82 » Evolutionary learning of small networks |
ICML
2007
IEEE
16 years 16 days ago
2007
IEEE
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
120
click to vote
GECCO
2008
Springer
15 years 24 days ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
125
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
The most popular way to use probabilistic models in vision is first to extract some descriptors of small image patches or object parts using well-engineered features, and then to...
99
Voted
KDD
2007
ACM
16 years 3 days ago
2007
ACM
This work studies the problem of distributed classification in peer-to-peer (P2P) networks. While there has been a significant amount of work in distributed classification, most o...
NIPS
1996
15 years 1 months ago
1996
Abstract. Validation can be used to detect when over tting starts during supervised training of a neural network; training is then stopped before convergence to avoid the over ttin...