Sciweavers

3247 search results - page 355 / 650
» Randomized smoothing networks
Sort
View
ICANN
2010
Springer
15 years 6 months ago
Tumble Tree - Reducing Complexity of the Growing Cells Approach
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
Hendrik Annuth, Christian-A. Bohn
COMPUTER
1999
82views more  COMPUTER 1999»
15 years 6 months ago
Mapping the Internet
Discovery of a network topology is a challenging task. Available algorithms that rely on simple hop-limited, traceroute-style probes give different performance in terms of the com...
Hal Burch, Bill Cheswick
IWQOS
2004
Springer
16 years 1 days ago
Small world overlay P2P networks
In this paper, we consider how to “construct” and “maintain” an overlay structured P2P network based on the “smallworld paradigm”. Two main attractive properties of a ...
Ken Y. K. Hui, John C. S. Lui, David K. Y. Yau
FLAIRS
2004
15 years 8 months ago
Recurrent Neural Networks and Pitch Representations for Music Tasks
We present results from experiments in using several pitch representations for jazz-oriented musical tasks performed by a recurrent neural network. We have run experiments with se...
Judy A. Franklin
BMCBI
2010
176views more  BMCBI 2010»
15 years 6 months ago
Bayesian statistical modelling of human protein interaction network incorporating protein disorder information
Background: We present a statistical method of analysis of biological networks based on the exponential random graph model, namely p2-model, as opposed to previous descriptive app...
Svetlana Bulashevska, Alla Bulashevska, Roland Eil...