6251 search results - page 211 / 1251 » Randomness, Computability, and Density |
157
click to vote
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
120
click to vote
COMBINATORICS
2004
15 years 4 months ago
2004
Characteristic polynomials of random unitary matrices have been intensively studied in recent years: by number theorists in connection with Riemann zetafunction, and by theoretica...
201
click to vote
ICMCS
2009
IEEE
15 years 2 months ago
2009
IEEE
In this paper, we present a novel localized Markov random field (MRF) method based on superpixels for region segmentation. Early vision problems could be formulated as pixel label...
159
click to vote
DCG
2011
14 years 11 months ago
2011
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
150
click to vote
TCS
2010
14 years 11 months ago
2010
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...