Sciweavers

2111 search results - page 62 / 423
» Understanding the Yarowsky Algorithm
Sort
View
CSC
2009
14 years 11 months ago
Fast Monte Carlo Algorithms on Re-Wired Small-World Spin Models
Small-world networks have become an important model for understanding many complex phenomena in science and in sociological contexts. One tool for exploring the critical and phase...
Kenneth A. Hawick
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
15 years 4 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett
NEUROSCIENCE
2001
Springer
15 years 2 months ago
Biological Grounding of Recruitment Learning and Vicinal Algorithms in Long-Term Potentiation
Biological networks are capable of gradual learning based on observing a large number of exemplars over time as well as of rapidly memorizing specific events as a result of a sin...
Lokendra Shastri
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 4 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
ICS
2009
Tsinghua U.
15 years 4 months ago
Dynamic topology aware load balancing algorithms for molecular dynamics applications
Molecular Dynamics applications enhance our understanding of biological phenomena through bio-molecular simulations. Large-scale parallelization of MD simulations is challenging b...
Abhinav Bhatele, Laxmikant V. Kalé, Sameer ...