6251 search results - page 228 / 1251 » Randomness, Computability, and Density |
116
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we consider the classical Erd˝os-R´enyi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ , for any fixed δ > 0, the chromatic number χ...
126
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
107
click to vote
STOC
1992
ACM
15 years 8 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
144
click to vote
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
131
click to vote
AML
2008
15 years 4 months ago
2008
We investigate notions of randomness in the space C(2N ) of continuous functions on 2N . A probability measure is given and a version of the Martin-L