4066 search results - page 12 / 814 » Almost Complete Sets |
NIPS
1998
13 years 9 months ago
1998
We compare the ability of three exemplar-based memory models, each using three different face stimulus representations, to account for the probability a human subject responded &q...
MLQ
2007
13 years 7 months ago
2007
Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the st...
ISAAC
1998
Springer
13 years 11 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
COCO
1994
Springer
13 years 11 months ago
1994
Springer
We show the following results regarding complete sets.
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...