2434 search results - page 35 / 487 » Algorithmic Randomness of Closed Sets |
109
click to vote
JCT
2007
15 years 1 months ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
141
click to vote
ICIP
2009
IEEE
14 years 11 months ago
2009
IEEE
The Expectation-Maximization (EM) algorithm is a popular tool in statistical estimation problems involving incomplete data or in problems which can be posed in a similar form, suc...
124
click to vote
FOCS
1994
IEEE
15 years 5 months ago
1994
IEEE
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
141
click to vote
COMGEO
1999
ACM
15 years 1 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
142
click to vote
TSE
2011
14 years 9 months ago
2011
—Randomized testing is an effective method for testing software units. Thoroughness of randomized unit testing varies widely according to the settings of certain parameters, such...