1319 search results - page 105 / 264 » Recursive Random Fields |
127
Voted
SIGMETRICS
2009
ACM
15 years 9 months ago
2009
ACM
Errors in dynamic random access memory (DRAM) are a common form of hardware failure in modern compute clusters. Failures are costly both in terms of hardware replacement costs and...
103
click to vote
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
114
Voted
JSC
2010
15 years 25 days ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
135
click to vote
CSCW
2012
ACM
13 years 10 months ago
2012
ACM
Although many off-line organizations give their employees training, mentorship, a cohort and other socialization experiences that improve their retention and productivity, online ...
102
Voted
CIE
2010
Springer
15 years 6 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...