Sciweavers

3536 search results - page 42 / 708
» Local dependent components
Sort
View
NIPS
2007
15 years 3 months ago
Theoretical Analysis of Learning with Reward-Modulated Spike-Timing-Dependent Plasticity
Reward-modulated spike-timing-dependent plasticity (STDP) has recently emerged as a candidate for a learning rule that could explain how local learning rules at single synapses su...
Robert A. Legenstein, Dejan Pecevski, Wolfgang Maa...
ICALP
2001
Springer
15 years 6 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
ADHOCNOW
2008
Springer
15 years 8 months ago
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
Andreas Wiese, Evangelos Kranakis
SAINT
2008
IEEE
15 years 8 months ago
Local Production, Local Consumption Storage Economics for Peer-to-Peer Systems
Autonomy of peer-to-peer (P2P) systems requires some form of economies. Forwardable storage claims of Samsara[1] can define a common value in computer networks, and possibly be a...
Kenji Saito, Eiichi Morino
EMMCVPR
2003
Springer
15 years 7 months ago
Asymptotic Characterization of Log-Likelihood Maximization Based Algorithms and Applications
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
Doron Blatt, Alfred O. Hero