118 search results - page 22 / 24 » A phase transition in the random transposition random walk |
116
click to vote
KDD
2008
ACM
16 years 25 days ago
2008
ACM
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
117
click to vote
SAT
2009
Springer
15 years 7 months ago
2009
Springer
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
131
Voted
SECON
2007
IEEE
15 years 6 months ago
2007
IEEE
— The capacity of wireless multi-hop networks has been studied extensively in recent years. Most existing work tackles the problem from an asymptotic perspective and assumes a si...
82
Voted
APPROX
2005
Springer
15 years 6 months ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
127
click to vote
NECO
2010
14 years 11 months ago
2010
Abstract: Reservoir Computing (RC) systems are powerful models for online computations on input sequences. They consist of a memoryless readout neuron which is trained on top of a ...