2996 search results - page 150 / 600 » Numberings and Randomness |
129
click to vote
ISAAC
1994
Springer
15 years 9 months ago
1994
Springer
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
135
click to vote
CIE
2010
Springer
15 years 9 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...
149
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
139
click to vote
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
199
click to vote
AI
2006
Springer
15 years 5 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...