2638 search results - page 98 / 528 » Random Geometric Complexes |
149
click to vote
PKDD
2004
Springer
15 years 10 months ago
2004
Springer
We show how carefully crafted random matrices can achieve distance-preserving dimensionality reduction, accelerate spectral computations, and reduce the sample complexity of certai...
144
click to vote
WIA
2009
Springer
15 years 11 months ago
2009
Springer
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 le...
133
click to vote
RSA
2006
15 years 4 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
128
click to vote
CVIU
2007
15 years 4 months ago
2007
This article proposes a generative image model, which is called ‘‘primal sketch,’’ following Marr’s insight and terminology. This model combines two prominent classes of...
131
click to vote
ICTAI
1999
IEEE
15 years 8 months ago
1999
IEEE
Recently there has been significant progress in our understanding of the computational nature of combinatorial problems. Randomized search methods, both complete and incomplete, o...